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 19:37Victor MerckléVictor MerckléScore: 10,307Success
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 19:4010,233118,772,01882,264,0002,675,00024,576stderr
2Sep 11, 2026 19:4010,290119,881,64083,738,0001,672,00024,576stderr
3Sep 11, 2026 19:4010,290119,823,81882,709,0002,701,00024,576stderr
4Sep 11, 2026 19:4010,300119,897,33782,785,0002,713,00024,576stderr
5Sep 11, 2026 19:4010,307119,479,60582,858,0002,691,00024,576stderr
6Sep 11, 2026 19:4010,342119,710,92383,003,0002,836,0002,117,632stderr
7Sep 11, 2026 19:4010,349119,679,09583,205,0002,694,00024,576stderr
8Sep 11, 2026 19:4010,359121,484,94883,322,0002,665,00024,576stderr
9Sep 11, 2026 19:4010,370120,630,01482,895,0003,179,0002,117,632stderr