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:44Andrew EpsteinAndrew EpsteinScore: 90,350Success
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:4789,959757,010,416743,371,0003,296,0002,117,632stderr
2Sep 17, 2026 02:4790,046757,837,713744,060,0003,324,0002,117,632stderr
3Sep 17, 2026 02:4790,237760,095,138745,758,0003,213,0002,121,728stderr
4Sep 17, 2026 02:4790,259760,220,726745,935,0003,222,0002,121,728stderr
5Sep 17, 2026 02:4790,350760,285,956746,696,0003,215,0002,117,632stderr
6Sep 17, 2026 02:4790,566762,909,885748,697,0003,008,0002,117,632stderr
7Sep 17, 2026 02:4790,580762,217,837749,575,0002,239,0002,121,728stderr
8Sep 17, 2026 02:4790,742764,281,571750,146,0003,018,0002,121,728stderr
9Sep 17, 2026 02:4791,015765,951,616752,411,0003,020,0002,121,728stderr