For the variance (square of std), personally I would use this simple one:
( n (sum x*x ) - (sum x)*(sum x) ) / (n*n) orbetter: ( (sum x*x ) - (sum x)*(sum x) / n ) / n
[ For the case of relatively small variance ("catastrophic cancellation") check also: http://www.daheiser.info/excel/notes/NOTE%20P.pdf ]
A viki page also reports a nice discussion: http://en.wikipedia.org/wiki/Algorithms_for_calculating_variance#cite_note-1
In particular, it mentions: A numerically stable algorithm is given below. It also computes the mean. This algorithm is due to Knuth, who cites Welford. [...] This algorithm is much less prone to loss of precision due to massive cancellation, but might not be as efficient because of the division operation inside the loop.
About the 2-pass algo, it says: "This algorithm is often more numerically reliable than the naïve algorithm for large sets of data, although it can be worse if much of the data is very close to but not precisely equal to the mean and some are quite far away from it."
I'd say that if the variance is not small (as often happens) and ease and speed of computation are a priority, the simpler version (closer to the definition) could still be considered.