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 17, 2026 03:00Andrew EpsteinAndrew EpsteinScore: 44,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 03:0144,300378,076,163365,510,0002,184,0002,121,728stderr
2Sep 17, 2026 03:0144,432379,116,425366,620,0002,171,0002,121,728stderr
3Sep 17, 2026 03:0144,436379,831,386366,622,0002,200,0002,117,632stderr
4Sep 17, 2026 03:0144,454379,330,198366,804,0002,172,0002,121,728stderr
5Sep 17, 2026 03:0144,473379,514,176366,941,0002,193,0002,121,728stderr
6Sep 17, 2026 03:0144,534380,666,540367,425,0002,215,0002,121,728stderr
7Sep 17, 2026 03:0144,570380,962,437367,739,0002,199,0002,121,728stderr
8Sep 17, 2026 03:0144,602380,506,521367,987,0002,213,0002,121,728stderr
9Sep 17, 2026 03:0144,623382,754,909368,169,0002,204,0002,121,728stderr