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 18:04Victor MerckléVictor MerckléScore: 6,981Success
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 18:046,97968,131,27856,920,0001,006,0002,113,536
2May 15, 2026 18:046,98067,237,26356,933,0001,009,0002,113,536
3May 15, 2026 18:046,98066,480,38056,893,0001,042,0002,113,536
4May 15, 2026 18:046,98166,907,44156,912,0001,031,0002,113,536
5May 15, 2026 18:046,98166,770,64057,944,00002,113,536
6May 15, 2026 18:046,98367,805,99656,918,0001,047,0002,113,536
7May 15, 2026 18:047,02967,422,93857,299,0001,042,0002,113,536
8May 15, 2026 18:047,03365,892,09357,335,0001,039,0002,113,536
9May 15, 2026 18:047,14468,710,80459,301,00002,113,536