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 25, 2026 15:46Victor MerckléVictor MerckléScore: 6,733Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 15:476,69363,050,21754,458,0001,101,0002,113,536
2Jun 25, 2026 15:476,70363,105,78954,541,0001,097,0002,113,536
3Jun 25, 2026 15:476,71164,562,91254,607,0001,099,0002,113,536
4Jun 25, 2026 15:476,72363,268,28354,709,0001,093,0002,113,536
5Jun 25, 2026 15:476,73363,384,04454,772,0001,112,0002,113,536
6Jun 25, 2026 15:476,75163,541,80554,933,0001,103,0002,113,536
7Jun 25, 2026 15:476,76163,577,85855,103,0001,020,0002,113,536
8Jun 25, 2026 15:476,81063,987,46855,430,0001,097,0002,113,536
9Jun 25, 2026 15:476,81764,095,22855,495,0001,090,0002,113,536