The inability to represent 0.1 properly in binary floating point is not a problem solved by increasing the precision your floating point library.
Also, there can be be surprising cases where single-precision might not be enough. For example, if you are going to represent exchange prices for, say, futures, you need to take into account that some of the price increments are in pennies, some in fractional dollars. You need the calculations to be reversible, and to have enough precision and accuracy to represent the whole range of price increments and expected volume.
One example of a lack of appropriate paranoia about floating point numbers was the i'm-not-very-good-at-writing-parsers' author of ASP and the result was http://www.exploringbinary.com/php-hangs-on-numeric-value-2-... denial of service to all unpatched PHP sites. Also bit java.
Note that interesting prime number work depends on integers and won't work with floating point. Including factoring large numbers in cryptography.
...I think you'll want to use a priority queue, with the smallest numbers on top, adding the first two, and then pushing the result back onto the priority queue. Repeat until you only have one item left.
> you need to sort them first
Yes, but only if there are quite a lot of them and the partial sums are large relative to the result. Not really an issue usually.
> The inability to represent 0.1
Many mathematical conjectures apply for arbitrary real numbers. The nearest floating point number to 0.1 is a real number, and it's not really an issue for mathematics that it's not exactly 0.1.
> single-precision might not be enough
These are mathematicians working in Mathematica, which has an arbitrary-precision floating-point type. They don't have to come anywhere near single precision floats.
> if you are going to represent exchange prices
You can use integers. Floating-point arithmetic isn't really great here because it makes the wrong kinds of accuracy guarantees.
> prime number work
Primes numbers are all integers. It would be a bit silly to represent integers with floating-point numbers.
Similarly, if I need to write an app that deals with real money (say, a banking application), you can bet your bottom dollar I'll be using integer arithmetic.
That is precisely the point.
> To avoid the usual problems with floating point arithmetic (rounding, truncating, instability), we construct all our examples with integers.
I think this is complete overkill. I know floating-point arithmetic can be tricky, but it's not at all random. If you have a stable algorithm and a multiple precision floating-point library, you can use floating point numbers. It won't necessarily give you a proof that your result (unless you spend time to derive rigorous error bounds), but it will certainly be good enough.
I think people sometimes do slightly irrational things for fear of floating-point arithmetic.