Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJul 7, 2026 10:24Kevin HeaveyKevin HeaveyError
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 10:24061,727,08751,046,0001,133,0002,117,632expected "53692492291168633 ", got "494959911109916200"
2Jul 7, 2026 10:24062,438,58951,744,0001,141,0002,117,632expected "53676950031439965 ", got "495206189483139161"
3Jul 7, 2026 10:24061,607,17550,969,0001,134,0002,117,632expected "53680602782721539 ", got "494054770889263192"