Let $U_1,U_2,\ldots$ be iid random variables distributed uniformly on $[0,1]$. I am interested in the random walk $X_i = \sum_{j \leq i} U_j$. In particular,

What is the expected number of points appearing in an interval $[x,x+1]$?

Experimentally, this seems to converge to $2$.

Here is an intuitive explanation. Suppose that $x+1-\delta$ is the first point within the interval $[x,x+1]$ which the random walk hits. One can calculate that the expected number of points within the interval is $e^\delta$. To estimate the distribution of $\delta$, consider the point $x-\epsilon$ just preceding $x+1-\delta$. Assuming that $\epsilon$ is uniformly distributed (which is close to the truth when $x$ is large), the density of $\delta$ at a point $\delta'$ is proportional to $\Pr[\epsilon \leq \delta'] = \delta'$, and so it is $2\delta'$. Therefore the expected number of points in $[x,x+1]$ is $$ \int_0^1 2\delta e^\delta \, \mathrm{d}\delta = 2. $$