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 listJul 5, 2026 21:04Kevin HeaveyKevin HeaveyScore: 4,550Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:32Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 21:074,43146,306,05535,536,0001,244,0002,117,632
2Jul 5, 2026 21:074,43446,401,08835,561,0001,246,0002,117,632
3Jul 5, 2026 21:074,47046,592,53935,949,0001,152,0002,117,632
4Jul 5, 2026 21:074,52147,098,44436,513,0001,018,0002,117,632
5Jul 5, 2026 21:074,55047,352,55536,617,0001,149,0002,117,632
6Jul 5, 2026 21:074,57447,588,35036,772,0001,194,0002,117,632
7Jul 5, 2026 21:074,62447,906,79537,233,0001,152,0002,117,632
8Jul 5, 2026 21:074,65148,102,95637,462,0001,145,0002,117,632
9Jul 5, 2026 21:074,77850,589,28138,476,0001,186,0002,117,632