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:27Josu San MartinJosu San MartinScore: 8,100Success
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:307,99475,771,04563,053,0003,305,0002,113,536
2Jul 3, 2026 23:308,00075,787,79763,126,0003,277,0002,113,536
3Jul 3, 2026 23:308,01375,815,97763,253,0003,261,0002,113,536
4Jul 3, 2026 23:308,04976,254,00863,626,0003,187,0002,113,536
5Jul 3, 2026 23:308,10076,577,09763,958,0003,280,0002,113,536
6Jul 3, 2026 23:308,12076,754,89764,192,0003,205,0002,113,536
7Jul 3, 2026 23:308,17877,220,25664,581,0003,301,0002,113,536
8Jul 3, 2026 23:308,19877,386,84464,811,0003,237,0002,113,536
9Jul 3, 2026 23:308,44179,449,25566,757,0003,310,0002,113,536