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 listMar 21, 2026 07:22olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:33047,856,68337,306,0001,025,0002,117,632expected "74600294196621100 ", got "35707282697641004 "
2Jul 7, 2026 05:33046,451,22135,891,0001,027,0002,117,632expected "74600294196621100 ", got "53553128430087980 "
3Jul 7, 2026 05:33046,672,77136,059,0001,028,0002,117,632expected "74600294196621100 ", got "36631447358497580 "
4Mar 21, 2026 07:225,71867,194,16344,429,0003,029,0002,301,952
5Mar 21, 2026 07:225,73279,193,35644,541,0003,036,0002,478,080
6Mar 21, 2026 07:225,76379,620,08344,841,0002,989,0002,461,696