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 17, 2026 02:30Andrew EpsteinAndrew EpsteinScore: 87,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:3186,196725,613,604714,426,0001,001,0002,117,632stderr
2Sep 17, 2026 02:3186,644729,872,423718,141,0001,007,0002,117,632stderr
3Sep 17, 2026 02:3186,866731,105,120719,987,0001,002,0002,117,632stderr
4Sep 17, 2026 02:3186,984732,247,556720,968,0001,001,0002,117,632stderr
5Sep 17, 2026 02:3187,080733,712,253721,758,0001,006,0002,117,632stderr
6Sep 17, 2026 02:3187,101733,136,891721,940,0001,001,0002,117,632stderr
7Sep 17, 2026 02:3187,182733,815,574722,615,0001,001,0002,117,632stderr
8Sep 17, 2026 02:3187,296734,674,184723,559,0001,005,0002,117,632stderr
9Sep 17, 2026 02:3187,508737,216,944725,317,0001,007,0002,117,632stderr