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 14, 2026 23:45Kevin HeaveyKevin HeaveyScore: 3,698Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 16, 2026 08:06wn10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 23:463,68041,643,74829,330,0001,215,0002,117,632
2Jul 14, 2026 23:463,69040,224,84929,449,0001,182,0002,117,632
3Jul 14, 2026 23:463,69140,221,09329,616,0001,022,0002,117,632
4Jul 14, 2026 23:463,69640,273,02129,484,0001,196,0002,117,632
5Jul 14, 2026 23:463,69840,367,51529,673,0001,026,0002,117,632
6Jul 14, 2026 23:463,70240,377,32729,683,0001,049,0002,117,632
7Jul 14, 2026 23:463,70440,448,39729,731,0001,020,0002,117,632
8Jul 14, 2026 23:463,70740,345,42429,748,0001,027,0002,117,632
9Jul 14, 2026 23:463,79041,116,24930,414,0001,046,0002,117,632