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 13:28Andrew EpsteinAndrew EpsteinScore: 9,942Success
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 13:369,79890,138,98680,227,0001,100,0002,117,632stderr
2Sep 17, 2026 13:369,85090,516,93080,646,0001,109,0002,117,632stderr
3Sep 17, 2026 13:369,85290,534,15980,637,0001,141,0002,117,632stderr
4Sep 17, 2026 13:369,90090,902,92481,060,0001,112,0002,117,632stderr
5Sep 17, 2026 13:369,94291,293,25181,409,0001,114,0002,117,632stderr
6Sep 17, 2026 13:369,94591,318,64381,439,0001,107,0002,117,632stderr
7Sep 17, 2026 13:369,97691,600,34981,661,0001,147,0002,117,632stderr
8Sep 17, 2026 13:369,97891,611,24381,702,0001,116,0002,117,632stderr
9Sep 17, 2026 13:369,99191,691,98481,821,0001,107,0002,117,632stderr