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 listSep 14, 2026 05:33Victor MerckléVictor MerckléScore: 3,526Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 05:373,47839,308,54327,849,0001,024,0002,117,632stderr
2Sep 14, 2026 05:373,49339,959,68227,981,0001,011,0002,117,632stderr
3Sep 14, 2026 05:373,51938,984,31428,195,0001,020,0002,117,632stderr
4Sep 14, 2026 05:373,52539,562,79128,256,0001,008,0002,117,632stderr
5Sep 14, 2026 05:373,52639,030,03228,259,0001,015,0002,117,632stderr
6Sep 14, 2026 05:373,53339,100,61628,298,0001,026,0002,117,632stderr
7Sep 14, 2026 05:373,55440,032,87428,480,0001,026,0002,117,632stderr
8Sep 14, 2026 05:373,55640,014,84928,505,0001,013,0002,117,632stderr
9Sep 14, 2026 05:373,56639,337,30128,581,0001,025,0002,117,632stderr