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 listMar 20, 2026 00:29olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:51Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:52062,778,37038,990,0002,029,0002,117,632expected "74600294196621100 ", got "36675201009270828 "
2Jul 7, 2026 05:52052,733,13138,398,0001,023,0002,121,728expected "74600294196621100 ", got "47748980356191020 "
3Jul 7, 2026 05:52048,402,03937,787,0001,023,0002,117,632expected "74600294196621100 ", got "47748611356151340 "
4Mar 20, 2026 00:295,79373,851,88141,069,0007,011,0002,473,984
5Mar 20, 2026 00:295,80173,835,59746,145,0002,006,0002,469,888
6Mar 20, 2026 00:295,83971,016,49442,404,0006,057,0002,473,984