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 listFeb 18, 2026 22:41Josu San MartinJosu San MartinScore: 6,181Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:416,00879,150,94448,872,000997,0002,420,736
2Feb 18, 2026 22:416,01571,152,25448,928,000998,0002,285,568
3Feb 18, 2026 22:416,13175,801,35048,892,0001,995,0002,293,760
4Feb 18, 2026 22:416,18179,556,77150,296,0001,005,0002,375,680
5Feb 18, 2026 22:416,19473,083,99951,411,00002,281,472
6Feb 18, 2026 22:416,26477,915,33349,990,0001,999,0002,514,944