Is there some (edit! analytic) expression $h(x)$ such that the sum $$\sum_{i=1}^n h(i)$$ scales as $O\left(n^\frac{1}{2}\right)$?
Regarding the (40) comments under Sabyasachi's accepted answer: When you run a sum like $\sum_{i=1}^{n}\frac{1}{c\sqrt{x}}$ in WolframAlpha, the output should be interpreted as HarmonicNumber[n,1/2] (http://reference.wolfram.com/mathematica/ref/HarmonicNumber.html), where $r = \frac{1}{2}$ is the order of the harmonic number. $H_n^{\frac{1}{2}} \neq \sqrt{H_n}$! It's rather surprising that Sabyasachi and I got as far as we did before he noticed the error.
While 5xum's answer of the sum being $\sqrt{x}$ is certainly great, here is something easier to spot. Let $f(x)=\frac1{2\sqrt{x}}$. This can be bounded by the integral. The sum is $\Theta(\sqrt{n})$. Test results.
For $n=100$, sum is $9.24$
For n=1000, sum is $30.88$
For n=10000, sum is $99.26$
Pretty right?
Proof:
Obviously if $f$ is a monotonically decreasing function
$$\sum_{i=1}^nf(i) \lt \int_1^{n+1}f(x)\,dx$$
Similarly
$$\sum_{i=2}^nf(i)\gt\int_1^nf(x)\,dx()$$
or
$$\sum_{i=1}^nf(i)\gt f(1)+\int_1^nf(x)\,dx$$
Let $f(x)=\frac{1}{2\sqrt{x}}$ and we are done.