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 listMay 10, 2026 19:36Josu San MartinJosu San MartinScore: 3,925Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:363,87242,006,20131,086,0001,058,0002,113,536
2May 10, 2026 19:363,89039,469,82031,211,0001,078,0002,113,536
3May 10, 2026 19:363,89242,445,72431,232,0001,079,0002,113,536
4May 10, 2026 19:363,89239,866,25431,236,0001,072,0002,113,536
5May 10, 2026 19:363,92541,550,13131,522,0001,058,0002,113,536
6May 10, 2026 19:363,94540,234,17131,743,0001,008,0002,113,536
7May 10, 2026 19:363,95340,016,22731,755,0001,063,0002,113,536
8May 10, 2026 19:364,00440,520,65232,148,0001,087,0002,113,536
9May 10, 2026 19:367,25567,652,18359,153,0001,070,0002,113,536