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 19:44Victor MerckléVictor MerckléScore: 4,538Success
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:454,52445,205,93836,455,0001,095,0002,117,632stderr
2Jun 24, 2026 19:454,52545,550,69136,440,0001,121,0002,117,632stderr
3Jun 24, 2026 19:454,52945,563,95536,478,0001,119,0002,117,632stderr
4Jun 24, 2026 19:454,53845,315,09836,556,0001,112,0002,117,632stderr
5Jun 24, 2026 19:454,53845,749,74636,587,0001,081,0002,117,632stderr
6Jun 24, 2026 19:454,53846,110,27536,567,0001,099,0002,117,632stderr
7Jun 24, 2026 19:454,71046,760,09138,072,0001,025,0002,117,632stderr
8Jun 24, 2026 19:454,71246,921,32938,009,0001,104,0002,117,632stderr
9Jun 24, 2026 19:454,74947,100,09538,393,0001,028,0002,117,632stderr