This paper was triggered by recent results on the maximal ‘average distance between consecutive points’ of uniformly distributed sequences (u.d.s.). Here we address a generalized version of this question, consider pairwise maximal/minimal/total distances in blocks/segments of $d\ge 2$ consecutive points of u.d.s., and derive sharp upper bounds for all three aggregations. Our main idea of proof consists in, firstly, adding degrees of freedom, secondly, translating the resulting problem to a solvable optimization problem over the compact family of $d$-stochastic measures, and, thirdly, showing that the obtained bounds are also sharp bounds for the original problem.