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 listFeb 20, 2026 18:16Daniel MastalerzDaniel MastalerzScore: 5,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 18:165,78173,863,66443,984,0003,998,0002,330,624
2Feb 20, 2026 18:165,80370,833,82745,156,0003,010,0002,330,624
3Feb 20, 2026 18:165,88876,454,20144,883,0003,989,0002,306,048
4Feb 20, 2026 18:165,90874,299,71245,031,0004,002,0002,269,184
5Feb 20, 2026 18:166,02571,109,50346,010,0004,000,0002,285,568
6Feb 20, 2026 18:166,04273,244,46048,146,0002,006,0002,306,048