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 15, 2026 11:47boop34boop34Score: 9,036Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2026 11:489,00184,394,94173,499,0001,214,0002,113,536
2Jul 15, 2026 11:489,01984,401,86673,763,0001,099,0002,113,536
3Jul 15, 2026 11:489,03184,574,60773,852,0001,107,0002,113,536
4Jul 15, 2026 11:489,03484,531,23273,774,0001,210,0002,113,536
5Jul 15, 2026 11:489,03684,554,11773,987,0001,015,0002,113,536
6Jul 15, 2026 11:489,03684,558,71973,886,0001,114,0002,113,536
7Jul 15, 2026 11:489,04584,740,35273,950,0001,125,0002,113,536
8Jul 15, 2026 11:489,05484,649,15574,039,0001,111,0002,113,536
9Jul 15, 2026 11:489,06884,895,20574,127,0001,140,0002,113,536