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 03:18Andrew EpsteinAndrew EpsteinScore: 83,790Success
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 03:1982,787697,545,623683,991,0003,149,0002,117,632stderr
2Sep 17, 2026 03:1982,990699,230,302686,722,0002,097,0002,121,728stderr
3Sep 17, 2026 03:1983,221701,769,095688,618,0002,121,0002,121,728stderr
4Sep 17, 2026 03:1983,589704,908,094690,673,0003,117,0002,117,632stderr
5Sep 17, 2026 03:1983,790705,834,113693,342,0002,123,0002,117,632stderr
6Sep 17, 2026 03:1983,914707,582,935694,393,0002,101,0002,121,728stderr
7Sep 17, 2026 03:1983,939707,756,608694,565,0002,130,0002,117,632stderr
8Sep 17, 2026 03:1984,015708,485,836694,197,0003,131,0002,121,728stderr
9Sep 17, 2026 03:1984,137709,369,161696,215,0002,124,0002,121,728stderr