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 listJul 9, 2026 17:39Victor MerckléVictor MerckléScore: 4,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 17:414,05641,760,32632,537,0001,135,0002,117,632stderr
2Jul 9, 2026 17:414,08141,984,47732,756,0001,123,0002,117,632stderr
3Jul 9, 2026 17:414,08141,900,24032,852,0001,022,0002,117,632stderr
4Jul 9, 2026 17:414,09741,828,30532,976,0001,035,0002,117,632stderr
5Jul 9, 2026 17:414,11242,237,19033,121,0001,011,0002,117,632stderr
6Jul 9, 2026 17:414,11542,257,47133,107,0001,048,0002,117,632stderr
7Jul 9, 2026 17:414,12842,304,08033,212,0001,053,0002,117,632stderr
8Jul 9, 2026 17:414,16542,545,92933,563,0001,008,0002,117,632stderr
9Jul 9, 2026 17:414,28743,771,98134,555,0001,034,0002,117,632stderr