  Let $d_1\leq d_2\leq\ldots\leq d_{n\choose 2}$ denote the distances
determined by $n$ points in the plane. It is shown that $\min\sum_i
(d_{i+1}-d_i)^2=O(n^{-6/7})$, where the minimum is taken over all point sets
with minimal distance $d_1 \geq 1$. This bound is asymptotically tight.
