Consider a sequence of rational numbers $s_i$ with the following property: For each rational number $s$ and nonnegative integer $n$, there exists $i$ such that $ s=s_i =s_{i+1} = \dots = s_{i+n}$, and $|s_{i+j}| \leq (3/2)^j$ for $j>n$.
Such a sequence certainly exists: The set of pairs $(s,n)$ is countable, so we can order all the pairs and satisfy them in sequence. After satisfying some of the pairs, we have fixed some initial segment $s_1,\dots, s_m$. If we didn't have the second condition we could simply set $s_{m+1} = \dots = s_{m+1+n} =s $. With the second condity, we may have to choose $s_{m+1},\dots, s_{m+k}$ small for some $k$ and then choose $s_{m+k+1} = \dots = s_{m+k+1+n}=s$, but we can always do this.
Now consider the set of vectors in $\mathbb R^2$ of the form $$ \left\{\sum_{i=1}^\infty e_i 2^{-i} (1,s_i) \mid e_1,e_2,\dots \in \{0,1\}\right\}$$. In other words, this is the image of the set of infinite binary sequences under the map which sends each binary sequence $e_1,e_2,\dots$ to the sum $\sum_{i=1}^\infty e_i 2^{-i} (1,s_i)$.
The projection of this set onto the $x$ axis is $$\left \{\sum_{i=1}^\infty e_i 2^{-i} \mid e_1,e_2,\dots \in \{0,1\}\right\}=[0,1]$$ which has positive measure.
Let's show the projection onto every line not parallel to the $x$ axis has measure $0$. It suffices to check for the projection onto the line $x= -ty$ for every real number $t$. The projection of the set onto that line is given by
$$\left \{\sum_{i=1}^\infty e_i 2^{-i} (t-s_i) \mid e_1,e_2,\dots \in \{0,1\}\right\}.$$
Observe that for any $j$, this set is contained in the union of $2^{j-1}$ intervals of length
$$\sum_{i=j}^\infty 2^{-i} |t-s_i|$$
where each interval consists of points lying between the maximum and minimum possible value of $\sum_{i=1}^\infty e_i 2^{-i} (t-s_i)$ for $e_1,\dots,e_{j-1}$ taking some fixed $j-1$-tuple of values. Hence the measure is at most
$$\sum_{i=j}^\infty 2^{j-1-i} |t-s_i|.$$
If we choose $j$ so that $s_j= s_{j+1} = \dots = s_{j+n}=s$ for some rational approximation $s$ of $t$ and $s_{j+k} \leq (3/2)^k$ for $k>n$ then we have
$$\sum_{i=j}^\infty 2^{j-1-i} |t-s_i| = \sum_{i=j}^{j+n}2^{j-1-i} |t-s_i| + \sum_{i=j+n+1}^\infty |t-s_i|$$ $$ \leq \sum_{i=j}^{j+n}2^{j-1-i} |t-s| + \sum_{i=j+n+1}^{\infty}2^{j-1-i} ( |t| + (3/2)^{i-j} )$$
$$ \leq |t-s| + 2^{-n} |t| + 2 (3/4)^{n+1}$$
which we can make arbitrarily small by choosing $n$ large and $s$ a good rational approximation of $t$.