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 18, 2026 10:36boop34boop34Score: 9,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 10:369,32787,147,93676,381,0001,041,0002,113,536
2Jul 18, 2026 10:369,33388,549,00876,433,0001,035,0002,113,536
3Jul 18, 2026 10:369,33687,151,46376,487,0001,009,0002,113,536
4Jul 18, 2026 10:369,33687,243,39576,481,0001,009,0002,113,536
5Jul 18, 2026 10:369,34087,239,65876,511,0001,011,0002,113,536
6Jul 18, 2026 10:369,34387,295,01276,480,0001,073,0002,113,536
7Jul 18, 2026 10:369,35787,384,34976,652,0001,014,0002,113,536
8Jul 18, 2026 10:369,37187,454,48476,778,0001,009,0002,113,536
9Jul 18, 2026 10:369,38387,529,04276,853,0001,026,0002,113,536