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 listJun 24, 2026 21:00Victor MerckléVictor MerckléScore: 4,502Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 21:014,49245,114,29536,179,0001,106,0002,113,536
2Jun 24, 2026 21:014,49445,324,32936,215,0001,088,0002,113,536
3Jun 24, 2026 21:014,49645,197,79736,201,0001,118,0002,113,536
4Jun 24, 2026 21:014,49745,265,08236,198,0001,131,0002,113,536
5Jun 24, 2026 21:014,50244,957,91136,262,0001,108,0002,113,536
6Jun 24, 2026 21:014,50645,253,87336,266,0001,141,0002,113,536
7Jun 24, 2026 21:014,51545,051,45136,404,0001,071,0002,113,536
8Jun 24, 2026 21:014,55245,454,55536,676,0001,107,0002,113,536
9Jun 24, 2026 21:014,75146,986,28138,407,0001,030,0002,113,536