I have to compute the limit $\lim_{n\to +\infty}I_n$, where: $$\qquad I_n=\int_{[0,1]^n}\sqrt{\frac{1}{n}\sum_{i=1}^n x_i^2}\,d\mu.$$ I believe that its value is just $\frac{1}{\sqrt{3}}$, since the mean value of $x_i^2$ over the unit hypercube is $\frac{1}{3}$. Numerical experiments agree with this conjecture.
Moreover, since the square root is a concave function, Jensen's inequality gives $$ I_n \leq \frac{1}{\sqrt{3}}$$ and $\{I_n\}_{n\in\mathbb{N}}$ looks to be a monotonic sequence, but an extra insight is needed to prove the conjecture, maybe a sort of converse of Jensen's inequality or a clever application of Fubini's theorem.
http://en.wikipedia.org/wiki/Hoeffding%27s_inequality gives a way to bound the difference between $\frac{1}{\sqrt{3}}$ and the given integral. If we take $X_1,\ldots,X_n$ as indipendent random variables with a uniform distribution over $[0,1]$, then $X_1^2,\ldots,X_n^2$ are bounded indipendent random variables with density function $$ f(x)=\frac{1}{2\sqrt{x}}\cdot\mathbb{1}_{(0,1]}$$ and mean value $\frac{1}{3}$. If we set $\bar{X}=\frac{1}{n}\sum_{j=1}^{n}X_j^2$, the Hoeffding's inequality gives: $$ \mathbb{P}\left[\left|\bar{X}-\mathbb{E}[\bar{X}]\right|\geq t\right]\leq 2\exp\left(-2t^2 n\right),$$ hence by choosing $t=\sqrt{\frac{\log n}{4n}}$ we have: $$ \mu\left(\left\{\bar{x}\in[0,1]^n : \left|-\frac{1}{3}+\frac{1}{n}\sum_{i=1}^{n}x_i^2\right|\geq\sqrt{\frac{\log n}{4n}}\right\}\right)\leq\frac{2}{\sqrt{n}},$$ so: $$\int_{[0,1]^n}\sqrt{\frac{1}{n}\sum_{i=1}^{n}x_i^2}d\mu\geq\left(1-\frac{2}{\sqrt{n}}\right)\sqrt{\frac{1}{3}-\sqrt{\frac{\log n}{4n}}}$$ and $$\int_{[0,1]^n}\sqrt{\frac{1}{n}\sum_{i=1}^{n}x_i^2}d\mu\geq\frac{1}{\sqrt{3}}\left(1-\sqrt{\frac{\log n}{n}}\right)$$ for any $n\geq e^{64}.$