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:19Josu San MartinJosu San MartinScore: 9,945Success
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:199,78590,631,75174,751,0006,469,0002,121,728
2Jul 3, 2026 18:199,90491,574,88875,592,0006,618,0002,121,728
3Jul 3, 2026 18:199,91991,739,72875,952,0006,381,0002,121,728
4Jul 3, 2026 18:199,94191,849,77075,724,0006,790,0002,125,824
5Jul 3, 2026 18:199,94591,905,47175,745,0006,802,0002,117,632
6Jul 3, 2026 18:199,96392,053,80575,889,0006,805,0002,121,728
7Jul 3, 2026 18:199,96491,988,66576,143,0006,560,0002,121,728
8Jul 3, 2026 18:1910,00392,437,51576,247,0006,783,0002,121,728
9Jul 3, 2026 18:1910,03392,621,58176,554,0006,722,0002,121,728