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 15, 2026 14:16Victor MerckléVictor MerckléScore: 6,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 14:206,96266,039,76456,749,0001,036,0002,113,536
2May 15, 2026 14:206,96267,562,21456,786,0001,005,0002,113,536
3May 15, 2026 14:206,96366,849,21356,749,0001,045,0002,113,536
4May 15, 2026 14:206,96567,827,80956,808,0001,007,0002,113,536
5May 15, 2026 14:206,97065,143,14656,851,0001,007,0002,113,536
6May 15, 2026 14:207,01665,511,54357,191,0001,044,0002,113,536
7May 15, 2026 14:207,01865,782,24757,220,0001,035,0002,113,536
8May 15, 2026 14:207,02368,478,74057,292,0001,001,0002,113,536
9May 15, 2026 14:207,08367,421,10957,795,0001,001,0002,113,536