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 23:59Josu San MartinJosu San MartinScore: 10,000Success
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 23:599,79190,802,94480,259,0001,014,0002,113,536
2Jul 3, 2026 23:599,80590,981,48080,372,0001,015,0002,113,536
3Jul 3, 2026 23:599,82891,118,98180,565,0001,015,0002,113,536
4Jul 3, 2026 23:599,97092,297,16081,744,0001,015,0002,113,536
5Jul 3, 2026 23:5910,00093,074,30081,988,0001,015,0002,113,536
6Jul 3, 2026 23:5910,01092,593,72682,074,0001,015,0002,113,536
7Jul 3, 2026 23:5910,03692,882,35282,286,0001,013,0002,113,536
8Jul 3, 2026 23:5910,04792,944,24582,377,0001,015,0002,113,536
9Jul 3, 2026 23:5910,05393,066,27582,428,0001,014,0002,113,536