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 15:03Victor MerckléVictor MerckléScore: 6,969Success
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 15:046,96366,530,59157,797,00002,113,536
2May 15, 2026 15:046,96566,070,83956,773,0001,041,0002,113,536
3May 15, 2026 15:046,96668,093,80457,818,00002,113,536
4May 15, 2026 15:046,96768,182,35456,780,0001,047,0002,113,536
5May 15, 2026 15:046,96965,665,37156,838,0001,005,0002,113,536
6May 15, 2026 15:046,97167,094,65456,816,0001,046,0002,113,536
7May 15, 2026 15:047,02065,602,36858,270,00002,113,536
8May 15, 2026 15:047,03365,704,17057,363,0001,012,0002,113,536
9May 15, 2026 15:047,10369,049,05557,929,0001,027,0002,113,536