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 06:12Victor MerckléVictor MerckléScore: 3,519Success
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 06:153,46438,512,09727,634,0001,119,0002,117,632stderr
2Sep 14, 2026 06:153,46939,205,06527,667,0001,126,0002,117,632stderr
3Sep 14, 2026 06:153,47340,184,43727,750,0001,076,0002,117,632stderr
4Sep 14, 2026 06:153,47438,400,91127,691,0001,151,0002,117,632stderr
5Sep 14, 2026 06:153,51939,669,09828,090,0001,123,0002,117,632stderr
6Sep 14, 2026 06:153,52138,942,58928,105,0001,121,0002,117,632stderr
7Sep 14, 2026 06:153,55941,114,32328,420,0001,124,0002,117,632stderr
8Sep 14, 2026 06:153,56139,885,03828,439,0001,121,0002,117,632stderr
9Sep 14, 2026 06:153,59240,354,45828,680,0001,138,0002,117,632stderr