AdvancedMultiple choice
You sum ten million small positive numbers in float32. What goes wrong and what fixes it?
- AThe running total grows until new terms fall below its epsilon; use Kahan summation or float64
- BNothing, since the sum is monotone and cannot overflow
- CThe result overflows to infinity
- DSorting the input makes no difference
The worked solution is in Premium
The answer, the full working and the one idea to take away – for this and all 1,322 questions in the bank. Answer it in practice and your working is marked, with a known mistake named when you make one.
Reported in interviews at
Citadel Securities, Two Sigma, Hudson River Trading, Jump Trading
More numerical methods questions
- What is machine epsilon for IEEE 754 double precision, in units of 10⁻¹⁶, to…Foundation
- Where doubles run out of digits, part 1 of 3Foundation
- Why do exchange systems store prices as integer ticks rather than as…Applied
- In double precision, what does 1 - math.cos(1e-8) evaluate to?Applied
- Double precision can represent every integer up to 2ᵏ exactly, but not every…Applied
- A loop total = 0.0; for _ in range(10): total += 0.1 leaves total == 0.9999999999999999.Applied