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 00:19Victor MerckléVictor MerckléScore: 3,963Success
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 00:213,82140,260,99627,953,0003,767,00024,576stderr
2Sep 8, 2026 00:213,92341,706,30528,511,0004,050,00024,576stderr
3Sep 8, 2026 00:213,93440,998,59828,944,0003,715,00024,576stderr
4Sep 8, 2026 00:213,93841,172,59827,982,0004,710,00024,576stderr
5Sep 8, 2026 00:213,96341,496,90628,724,0004,173,00024,576stderr
6Sep 8, 2026 00:213,97441,432,98228,584,0004,401,00024,576stderr
7Sep 8, 2026 00:213,97441,364,27928,569,0004,419,00024,576stderr
8Sep 8, 2026 00:213,99442,346,98028,902,0004,255,00024,576stderr
9Sep 8, 2026 00:214,07142,396,27229,179,0004,616,00024,576stderr