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 20:48Josu San MartinJosu San MartinScore: 8,460Success
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 20:498,42979,324,99463,198,0006,770,0002,121,728
2Jul 3, 2026 20:498,43679,454,10163,049,0006,975,0002,117,632
3Jul 3, 2026 20:498,45079,453,65463,354,0006,782,0002,121,728
4Jul 3, 2026 20:498,45679,510,39763,452,0006,734,0002,121,728
5Jul 3, 2026 20:498,46079,542,99663,494,0006,728,0002,121,728
6Jul 3, 2026 20:498,46779,633,90463,397,0006,884,0002,121,728
7Jul 3, 2026 20:498,47279,744,68763,642,0006,681,0002,121,728
8Jul 3, 2026 20:498,48079,724,68563,550,0006,835,0002,121,728
9Jul 3, 2026 20:498,51079,935,47763,749,0006,892,0002,121,728