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 listJul 18, 2026 12:59boop34boop34Score: 8,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 13:028,92583,749,56172,857,0001,221,0002,113,536
2Jul 18, 2026 13:028,94183,863,71573,012,0001,202,0002,113,536
3Jul 18, 2026 13:028,94383,817,61773,020,0001,213,0002,113,536
4Jul 18, 2026 13:028,95683,944,51673,127,0001,210,0002,113,536
5Jul 18, 2026 13:028,95683,930,95873,120,0001,217,0002,113,536
6Jul 18, 2026 13:028,98384,136,32273,508,0001,053,0002,113,536
7Jul 18, 2026 13:029,01984,457,15273,676,0001,186,0002,113,536
8Jul 18, 2026 13:029,03384,756,33873,873,0001,104,0002,113,536
9Jul 18, 2026 13:029,07284,961,80674,194,0001,104,0002,113,536