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 16, 2026 09:12boop34boop34Score: 8,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 09:138,97984,116,08473,521,0001,007,0002,113,536
2Jul 16, 2026 09:138,99284,150,32873,621,0001,013,0002,113,536
3Jul 16, 2026 09:138,99384,207,91373,626,0001,017,0002,113,536
4Jul 16, 2026 09:138,99984,238,37673,690,0001,009,0002,113,536
5Jul 16, 2026 09:138,99984,285,14573,686,0001,006,0002,113,536
6Jul 16, 2026 09:139,00384,217,44273,724,0001,007,0002,113,536
7Jul 16, 2026 09:139,00984,331,07673,772,0001,005,0002,113,536
8Jul 16, 2026 09:139,01784,539,93673,839,0001,007,0002,113,536
9Jul 16, 2026 09:139,11985,281,46274,637,0001,056,0002,113,536