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 19:15Josu San MartinJosu San MartinScore: 6,850Success
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 19:156,81466,009,57751,286,0005,278,0002,113,536
2Jul 3, 2026 19:156,81565,930,89251,173,0005,396,0002,113,536
3Jul 3, 2026 19:156,81766,034,79051,174,0005,412,0002,113,536
4Jul 3, 2026 19:156,83166,090,34851,426,0005,273,0002,113,536
5Jul 3, 2026 19:156,85066,316,80451,428,0005,435,0002,113,536
6Jul 3, 2026 19:156,90168,067,44751,756,0005,527,0002,113,536
7Jul 3, 2026 19:156,90666,675,45851,820,0005,508,0002,113,536
8Jul 3, 2026 19:156,94567,007,02552,164,0005,480,0002,113,536
9Jul 3, 2026 19:156,96667,207,75952,348,0005,470,0002,113,536