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 22:41Victor MerckléVictor MerckléScore: 6,955Success
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 22:416,95065,011,26657,692,00002,113,536
2May 15, 2026 22:416,95267,789,88756,699,0001,004,0002,113,536
3May 15, 2026 22:416,95366,847,29857,716,00002,113,536
4May 15, 2026 22:416,95467,043,83557,723,00002,113,536
5May 15, 2026 22:416,95568,538,21856,721,0001,010,0002,113,536
6May 15, 2026 22:416,95567,971,65656,721,0001,011,0002,113,536
7May 15, 2026 22:416,95765,115,56956,737,0001,013,0002,113,536
8May 15, 2026 22:416,95965,349,71456,758,0001,002,0002,113,536
9May 15, 2026 22:416,95965,946,07056,712,0001,049,0002,113,536