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 10:52Kevin HeaveyKevin HeaveyScore: 3,556Success
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 10:553,52937,611,32328,094,0001,204,0002,113,536
2Sep 6, 2026 10:553,54137,661,16728,203,0001,193,0002,113,536
3Sep 6, 2026 10:553,54437,737,18328,382,0001,034,0002,113,536
4Sep 6, 2026 10:553,54637,741,40728,241,0001,193,0002,113,536
5Sep 6, 2026 10:553,55637,853,41928,475,0001,044,0002,113,536
6Sep 6, 2026 10:553,62238,369,66228,855,0001,210,0002,113,536
7Sep 6, 2026 10:553,70739,026,28629,570,0001,201,0002,113,536
8Sep 6, 2026 10:553,83240,126,36030,575,0001,237,0002,113,536
9Sep 6, 2026 10:553,84040,199,52730,668,0001,205,0002,113,536