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 listJun 10, 2026 15:57Victor MerckléVictor MerckléScore: 6,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 15:576,91564,816,86556,384,0001,017,0002,113,536
2Jun 10, 2026 15:576,92865,122,56756,477,0001,031,0002,113,536
3Jun 10, 2026 15:576,93365,138,73956,514,0001,031,0002,113,536
4Jun 10, 2026 15:576,94165,231,73855,610,0002,006,0002,113,536
5Jun 10, 2026 15:576,94665,181,95055,637,0002,016,0002,113,536
6Jun 10, 2026 15:576,97665,535,96156,880,0001,029,0002,113,536
7Jun 10, 2026 15:577,01165,795,09356,186,0002,006,0002,113,536
8Jun 10, 2026 15:577,02965,853,90656,313,0002,031,0002,113,536
9Jun 10, 2026 15:577,07966,312,39256,735,0002,021,0002,113,536