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 16, 2026 05:40Victor MerckléVictor MerckléScore: 6,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:416,95064,997,33957,685,00002,113,536
2May 16, 2026 05:416,95165,034,15357,698,00002,113,536
3May 16, 2026 05:416,95267,817,89057,703,00002,113,536
4May 16, 2026 05:416,95365,091,93957,718,00002,113,536
5May 16, 2026 05:416,95667,949,66356,687,0001,053,0002,113,536
6May 16, 2026 05:417,00765,730,76858,163,00002,113,536
7May 16, 2026 05:417,02566,142,85357,313,0001,000,0002,113,536
8May 16, 2026 05:417,10568,959,25857,946,0001,029,0002,113,536
9May 16, 2026 05:417,19267,253,10858,660,0001,034,0002,113,536