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 9, 2026 23:23Josu San MartinJosu San MartinScore: 4,890Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:244,80259,028,34338,812,0001,050,0002,363,392
2May 9, 2026 23:244,80955,514,74138,870,0001,050,0002,363,392
3May 9, 2026 23:244,85456,045,22439,257,0001,034,0002,359,296
4May 9, 2026 23:244,87956,530,62639,463,0001,036,0002,371,584
5May 9, 2026 23:244,89057,151,07639,553,0001,039,0002,375,680
6May 9, 2026 23:244,92158,196,93639,818,0001,034,0002,375,680
7May 9, 2026 23:244,95656,615,91540,103,0001,040,0002,379,776
8May 9, 2026 23:245,10058,670,08141,036,0001,297,0002,371,584
9May 9, 2026 23:245,10956,997,13341,382,0001,026,0002,371,584