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:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:27048,564,69635,507,0002,034,0002,117,632expected "74600294196621100 ", got "53541236016999980 "
2Jul 7, 2026 05:27048,762,85337,117,0002,070,0002,117,632expected "74600294196621100 ", got "35710906586688300 "
3Jul 7, 2026 05:27046,242,00635,533,0001,055,0002,117,632expected "74600294196621100 ", got "41829376487079724 "
4Mar 21, 2026 07:225,67968,607,88044,124,0003,008,0002,494,464
5Mar 21, 2026 07:225,68170,083,04344,142,0003,009,0002,412,544
6Mar 21, 2026 07:225,70968,478,89246,374,0001,008,0002,469,888