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:30olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:39046,964,36236,368,0001,025,0002,113,536expected "74600294196621100 ", got "47051787963279404 "
2Jul 7, 2026 05:39048,241,95937,765,0001,023,0002,113,536expected "74600294196621100 ", got "47750768055223340 "
3Jul 7, 2026 05:39047,024,08736,561,0001,026,0002,113,536expected "74600294196621100 ", got "46992963598028844 "
4Mar 21, 2026 07:305,69572,039,73845,258,0002,011,0002,273,280
5Mar 21, 2026 07:305,76072,967,80144,821,0002,988,0002,359,296
6Mar 21, 2026 07:305,85374,009,02346,558,0002,024,0002,396,160