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 11, 2026 20:00Victor MerckléVictor MerckléScore: 10,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2026 20:2110,01992,545,12082,084,0001,074,0002,117,632stderr
2Sep 11, 2026 20:2110,03592,632,80182,180,0001,113,0002,117,632stderr
3Sep 11, 2026 20:2110,06392,881,48582,411,0001,120,0002,117,632stderr
4Sep 11, 2026 20:2110,08893,208,54182,629,0001,109,0002,117,632stderr
5Sep 11, 2026 20:2110,09493,053,59382,675,0001,109,0002,117,632stderr
6Sep 11, 2026 20:2110,10092,502,31382,811,0001,019,0002,117,632stderr
7Sep 11, 2026 20:2110,10093,453,61382,699,0001,131,0002,117,632stderr
8Sep 11, 2026 20:2110,13193,408,34483,061,0001,033,0002,117,632stderr
9Sep 11, 2026 20:2110,14493,545,14983,084,0001,118,0002,117,632stderr