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 28, 2026 02:12olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:43047,189,59535,586,0002,038,0002,117,632expected "74600294196621100 ", got "53560381000018732 "
2Jul 7, 2026 05:43047,486,59935,969,0002,001,0002,117,632expected "74600294196621100 ", got "53518210205097516 "
3Jul 7, 2026 05:43047,055,03236,461,0001,029,0002,117,632expected "74600294196621100 ", got "53554253187250988 "
4Mar 28, 2026 02:125,68472,950,31243,164,0004,015,0002,265,088
5Mar 28, 2026 02:125,76771,947,48243,874,0003,988,0002,355,200
6Mar 28, 2026 02:125,82074,812,44044,281,0004,025,0002,510,848