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 24, 2026 14:31Victor MerckléVictor MerckléScore: 4,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 14:324,88851,738,94139,497,0001,080,0002,113,536
2May 24, 2026 14:324,88850,317,86339,508,0001,067,0002,113,536
3May 24, 2026 14:324,89850,564,56039,578,0001,080,0002,113,536
4May 24, 2026 14:324,90750,283,75839,729,0001,006,0002,113,536
5May 24, 2026 14:324,92048,760,75339,828,0001,008,0002,113,536
6May 24, 2026 14:324,92048,714,09639,836,0001,008,0002,113,536
7May 24, 2026 14:324,92150,090,47039,817,0001,028,0002,113,536
8May 24, 2026 14:324,94148,888,96840,009,0001,006,0002,113,536
9May 24, 2026 14:324,94350,253,65140,000,0001,030,0002,113,536