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:28Victor MerckléVictor MerckléScore: 10,683Success
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:3010,66696,326,54387,389,0001,144,0002,113,536
2Jun 25, 2026 15:3010,67296,112,21687,492,0001,088,0002,113,536
3Jun 25, 2026 15:3010,68296,223,75387,593,0001,069,0002,113,536
4Jun 25, 2026 15:3010,68296,158,59287,582,0001,084,0002,113,536
5Jun 25, 2026 15:3010,68396,225,96187,572,0001,104,0002,113,536
6Jun 25, 2026 15:3010,69696,400,81287,698,0001,083,0002,113,536
7Jun 25, 2026 15:3010,72896,518,29488,035,0001,010,0002,113,536
8Jun 25, 2026 15:3010,73296,605,50688,073,0001,005,0002,113,536
9Jun 25, 2026 15:3010,74196,731,88188,084,0001,074,0002,113,536