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 16, 2026 18:28Victor MerckléVictor MerckléScore: 3,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2026 18:293,89942,209,76831,329,0001,035,0002,117,632stderr
2Sep 16, 2026 18:293,90442,249,35731,366,0001,039,0002,117,632stderr
3Sep 16, 2026 18:293,91442,300,03331,439,0001,048,0002,117,632stderr
4Sep 16, 2026 18:293,91542,346,52731,464,0001,034,0002,117,632stderr
5Sep 16, 2026 18:293,91542,296,32131,468,0001,030,0002,117,632stderr
6Sep 16, 2026 18:293,92742,448,07731,557,0001,044,0002,117,632stderr
7Sep 16, 2026 18:293,92742,408,32431,548,0001,053,0002,117,632stderr
8Sep 16, 2026 18:293,92942,440,36131,527,0001,086,0002,117,632stderr
9Sep 16, 2026 18:293,95442,692,91831,776,0001,050,0002,117,632stderr