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 13, 2026 11:32zielajzielajScore: 3,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 11:323,75253,822,59230,135,0001,004,0002,355,200
2Mar 13, 2026 11:343,75552,943,61529,157,0002,010,0002,269,184
3Mar 13, 2026 11:343,75555,550,89630,165,0001,005,0002,269,184
4Mar 13, 2026 11:323,76460,275,12330,236,0001,007,0002,347,008
5Mar 13, 2026 11:343,78454,368,21030,392,0001,013,0002,527,232
6Mar 13, 2026 11:323,78554,519,33531,416,00002,347,008