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 18:44Josu San MartinJosu San MartinScore: 9,513Success
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 18:449,41987,609,44373,080,0005,098,0002,113,536
2Jul 3, 2026 18:449,42387,615,08073,081,0005,131,0002,113,536
3Jul 3, 2026 18:449,45287,807,01773,257,0005,199,0002,113,536
4Jul 3, 2026 18:449,48688,079,34773,401,0005,337,0002,113,536
5Jul 3, 2026 18:449,51388,317,15273,782,0005,181,0002,113,536
6Jul 3, 2026 18:449,54088,546,88873,770,0005,412,0002,113,536
7Jul 3, 2026 18:449,54888,625,23574,057,0005,196,0002,113,536
8Jul 3, 2026 18:449,55388,686,09474,054,0005,244,0002,113,536
9Jul 3, 2026 18:449,56888,772,71174,140,0005,280,0002,113,536