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 6, 2026 15:34Kevin HeaveyKevin HeaveyScore: 3,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 15:383,67441,846,79629,196,0001,302,0002,129,920
2Sep 6, 2026 15:383,87142,093,92029,934,0002,198,0002,183,168
3Sep 6, 2026 15:383,95242,797,13431,501,0001,305,0002,129,920
4Sep 6, 2026 15:383,96043,148,63331,576,0001,293,0002,129,920
5Sep 6, 2026 15:383,96242,862,03830,490,0002,400,0002,183,168
6Sep 6, 2026 15:383,98042,981,26231,747,0001,293,0002,129,920
7Sep 6, 2026 15:383,98443,040,69730,902,0002,170,0002,183,168
8Sep 6, 2026 15:383,98843,117,21031,806,0001,297,0002,129,920
9Sep 6, 2026 15:384,02243,726,10732,087,0001,298,0002,129,920