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 18:59Victor MerckléVictor MerckléScore: 4,517Success
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 19:004,50245,035,09936,283,0001,089,0002,113,536
2Jun 24, 2026 19:004,50945,043,32536,332,0001,099,0002,113,536
3Jun 24, 2026 19:004,51044,957,56936,345,0001,093,0002,113,536
4Jun 24, 2026 19:004,51145,235,20136,342,0001,100,0002,113,536
5Jun 24, 2026 19:004,51745,081,61036,433,0001,065,0002,113,536
6Jun 24, 2026 19:004,52245,144,84136,532,0001,007,0002,113,536
7Jun 24, 2026 19:004,52745,138,71236,498,0001,080,0002,113,536
8Jun 24, 2026 19:004,53245,673,57636,508,0001,111,0002,113,536
9Jun 24, 2026 19:004,54945,786,25436,652,0001,107,0002,113,536