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 listFeb 2, 2026 03:09Josu San MartinJosu San MartinScore: 5,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 03:095,65775,063,44744,956,0001,998,0002,510,848
2Feb 2, 2026 03:095,66373,444,66045,000,0002,000,0002,281,472
3Feb 2, 2026 03:095,68373,537,99146,165,0001,003,0002,359,296
4Feb 2, 2026 03:095,70170,234,40846,311,0001,006,0002,293,760
5Feb 2, 2026 03:095,89375,568,34446,919,0001,996,0002,445,312
6Feb 2, 2026 03:096,410101,219,57751,198,0002,007,0002,293,760