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 21, 2026 10:06Daniel MastalerzDaniel MastalerzScore: 6,634Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 10:066,48679,970,92850,846,0002,990,0002,293,760
2Feb 21, 2026 10:066,61382,038,06551,892,0002,993,0002,514,944
3Feb 21, 2026 10:066,61881,080,90752,934,0001,997,0002,293,760
4Feb 21, 2026 10:066,63484,919,91252,060,0003,003,0002,269,184
5Feb 21, 2026 10:066,64180,257,05253,117,0002,004,0002,285,568
6Feb 21, 2026 10:066,77581,518,12554,227,0002,008,0002,285,568