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 listMay 21, 2026 13:42Victor MerckléVictor MerckléScore: 4,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:434,64647,940,68837,498,0001,069,0002,113,536
2May 21, 2026 13:434,65146,462,50437,546,0001,061,0002,113,536
3May 21, 2026 13:434,65449,254,79137,626,0001,008,0002,113,536
4May 21, 2026 13:434,65448,421,82837,614,0001,021,0002,113,536
5May 21, 2026 13:434,66849,777,47137,744,0001,003,0002,113,536
6May 21, 2026 13:434,68647,024,10937,896,0001,006,0002,113,536
7May 21, 2026 13:434,83747,968,17639,130,0001,024,0002,113,536
8May 21, 2026 13:434,90948,791,46139,710,0001,042,0002,113,536
9May 21, 2026 13:434,92750,710,23139,883,0001,015,0002,113,536