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 23, 2026 23:36Victor MerckléVictor MerckléScore: 9,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 23:378,97384,143,24873,401,0001,080,0002,113,536
2May 23, 2026 23:378,98383,309,36673,485,0001,078,0002,113,536
3May 23, 2026 23:378,99584,496,32373,595,0001,067,0002,113,536
4May 23, 2026 23:379,00185,378,64373,642,0001,069,0002,113,536
5May 23, 2026 23:379,00584,438,02973,676,0001,068,0002,113,536
6May 23, 2026 23:379,01083,913,95873,740,0001,045,0002,113,536
7May 23, 2026 23:379,01183,265,42973,692,0001,100,0002,113,536
8May 23, 2026 23:379,03082,691,02073,927,0001,027,0002,113,536
9May 23, 2026 23:379,09183,253,34074,367,0001,093,0002,113,536