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 8, 2026 19:04Victor MerckléVictor MerckléScore: 3,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 19:053,63538,799,19129,147,0001,024,0002,142,208stderr
2Sep 8, 2026 19:053,64338,839,67829,214,0001,024,0002,142,208stderr
3Sep 8, 2026 19:053,65438,855,22629,168,0001,161,0002,142,208stderr
4Sep 8, 2026 19:053,65438,887,66029,310,0001,024,0002,142,208stderr
5Sep 8, 2026 19:053,71039,325,45929,775,0001,024,0002,142,208stderr
6Sep 8, 2026 19:053,71139,305,11429,779,0001,024,0002,142,208stderr
7Sep 8, 2026 19:053,74439,611,72030,055,0001,023,0002,142,208stderr
8Sep 8, 2026 19:053,74739,671,98130,080,0001,022,0002,142,208stderr
9Sep 8, 2026 19:053,75739,718,44530,164,0001,022,0002,142,208stderr