News for hackers. Stuff that matters.
Re:How to Correctly Sum Up Numbers by tialaramex on Sunday November 03, 2024 @11:05AM (#42033806)
Rust's 32-bit floating point type is, unsurprisingly, named f32 (stable Rust also has f64, and unstable builds offer f16 and possibly f128 which are both newer IEEE formats)

If you're sure your answer is a 32-bit IEEE floating point number, I think you could store the intermediate sums as a fully expanded fixed point number with enough bits to go from the smallest possible f32 to the largest possible, so you're just doing (big integer) integer summation. 36 bytes ought to be very possible. When you've finished summing, you find the top-most set bit, its position decides the exponent and the subsequent 23 bits are your mantissa.

Re:How to Correctly Sum Up Numbers by lifthrasiir on Sunday November 03, 2024 @07:14PM (#42037229)
Indeed, this approach is known as a superaccumulator [1] and faster overall than the Kahan summation for a large amount of numbers. I don't exactly know the currently accepted threshold but 10,000 numbers should be conservative enough for that.

[1] https://arxiv.org/abs/1505.05571