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 22:06Victor MerckléVictor MerckléScore: 6,955Success
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 22:066,95165,367,47357,697,00002,113,536
2May 15, 2026 22:066,95166,672,02557,700,00002,113,536
3May 15, 2026 22:066,95265,180,93056,679,0001,030,0002,113,536
4May 15, 2026 22:066,95565,049,04956,681,0001,048,0002,113,536
5May 15, 2026 22:066,95565,026,59456,724,0001,003,0002,113,536
6May 15, 2026 22:066,95667,318,38656,703,0001,035,0002,113,536
7May 15, 2026 22:066,95767,238,71156,740,0001,007,0002,113,536
8May 15, 2026 22:066,95766,479,64556,741,0001,006,0002,113,536
9May 15, 2026 22:066,96765,116,29156,762,0001,070,0002,113,536