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 14, 2026 07:04Victor MerckléVictor MerckléScore: 6,985Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:046,96667,706,32556,784,0001,039,0002,113,536
2May 14, 2026 07:046,97166,653,14856,855,0001,005,0002,113,536
3May 14, 2026 07:046,97566,693,83356,884,0001,013,0002,113,536
4May 14, 2026 07:046,97865,324,66656,911,0001,008,0002,113,536
5May 14, 2026 07:046,98565,415,89457,982,00002,113,536
6May 14, 2026 07:047,02768,823,97558,331,00002,113,536
7May 14, 2026 07:047,02765,593,42358,327,00002,113,536
8May 14, 2026 07:047,03067,028,74258,357,00002,113,536
9May 14, 2026 07:047,09367,301,54657,861,0001,017,0002,113,536