Consider multiple sums $S_n$ on the $d$-dimensional integer grid,which are generated by i.i.d.\ random variables with a positive expectation. We prove the strong law of large numbers, the law of the iterated logarithm and the distributional limit theorem for random sets ${\mathcal M}_t$ that appear as inversion of the multiple sums, that is, as the set of all arguments $x\in{\mathbb R}_+^d$ such that the interpolated multiple sum $S_x$ exceeds $t$. The moment conditions are identical to those imposed in the almost sure limit theorems for multiple sums. The results are expressed in terms of set inclusions and using distances between sets.