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 03:59Victor MerckléVictor MerckléScore: 6,972Success
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 03:596,96665,828,61156,786,0001,036,0002,113,536
2May 15, 2026 03:596,96765,228,45357,834,00002,113,536
3May 15, 2026 03:596,97066,824,82157,857,00002,113,536
4May 15, 2026 03:596,97165,934,26156,857,0001,009,0002,113,536
5May 15, 2026 03:596,97267,394,37357,872,00002,113,536
6May 15, 2026 03:596,99267,504,71557,039,0001,002,0002,113,536
7May 15, 2026 03:597,02366,774,90357,250,0001,046,0002,113,536
8May 15, 2026 03:597,02366,760,93857,268,0001,030,0002,113,536
9May 15, 2026 03:597,18368,812,53258,617,0001,004,0002,113,536