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 19, 2026 10:42Victor MerckléVictor MerckléScore: 6,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 10:436,04258,003,71749,150,0001,002,0002,113,536
2May 19, 2026 10:436,04557,945,17649,135,0001,040,0002,113,536
3May 19, 2026 10:436,05358,049,52149,214,0001,033,0002,113,536
4May 19, 2026 10:436,06758,226,22749,318,0001,040,0002,113,536
5May 19, 2026 10:436,12758,672,01149,827,0001,035,0002,113,536
6May 19, 2026 10:436,16259,078,96550,141,0001,006,0002,113,536
7May 19, 2026 10:436,18559,163,29350,304,0001,034,0002,113,536
8May 19, 2026 10:436,18661,522,68950,342,0001,004,0002,113,536
9May 19, 2026 10:436,23961,620,49850,745,0001,040,0002,113,536