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 listJan 2, 2026 16:54Josu San MartinJosu San MartinScore: 6,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 16:546,78079,843,01356,277,00002,260,992
2Jan 2, 2026 16:546,78981,241,21455,339,0001,006,0002,392,064
3Jan 2, 2026 16:546,80779,120,82456,502,00002,277,376
4Jan 2, 2026 16:546,82289,506,49656,620,00002,285,568
5Jan 2, 2026 16:546,83787,635,25555,756,000995,0002,404,352
6Jan 2, 2026 16:546,84385,161,27054,807,0001,992,0002,265,088