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 6, 2026 17:07Mikołaj UzarskiMikołaj UzarskiScore: 39,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2026 17:0739,124348,832,382322,728,0001,998,0002,285,568
2Feb 6, 2026 17:0739,126346,965,275322,748,0001,998,0002,514,944
3Feb 6, 2026 17:0739,131347,901,500322,787,0001,998,0002,285,568
4Feb 6, 2026 17:0739,132347,139,874322,795,0001,998,0002,285,568
5Feb 6, 2026 17:0739,134347,343,950322,811,0001,998,0002,392,064
6Feb 6, 2026 17:0739,138348,545,800323,844,000999,0002,285,568
7Feb 6, 2026 17:0739,151351,508,450322,957,0001,999,0002,285,568
8Feb 6, 2026 17:0739,159348,286,604322,022,0003,000,0002,281,472
9Feb 6, 2026 17:0739,177351,293,085324,170,0001,000,0002,281,472