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 3, 2026 17:29Josu San MartinJosu San MartinScore: 16,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:2915,769140,279,703129,879,0001,009,0002,113,536
2Jul 3, 2026 17:2915,841140,814,982130,473,0001,009,0002,113,536
3Jul 3, 2026 17:2915,929141,595,225131,211,0001,007,0002,113,536
4Jul 3, 2026 17:2915,968141,917,346131,530,0001,010,0002,113,536
5Jul 3, 2026 17:2916,021142,343,181131,967,0001,010,0002,113,536
6Jul 3, 2026 17:2916,069142,784,912132,366,0001,009,0002,113,536
7Jul 3, 2026 17:2916,626147,359,602136,990,0001,006,0002,113,536
8Jul 3, 2026 17:2916,687147,853,168137,497,0001,008,0002,113,536
9Jul 3, 2026 17:2916,807148,931,316138,496,0001,007,0002,113,536