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 19, 2026 23:03olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:10047,190,76636,697,0001,026,0002,113,536expected "74600294196621100 ", got "46979838296407084 "
2Jul 7, 2026 05:10047,465,37036,854,0001,026,0002,113,536expected "74600294196621100 ", got "46986998539305772 "
3Jul 7, 2026 05:10047,194,93036,662,0001,025,0002,113,536expected "74600294196621100 ", got "47059428943300140 "
4Mar 19, 2026 23:035,60871,243,37443,512,0003,035,0002,502,656
5Mar 19, 2026 23:035,60873,933,77640,475,0006,071,0002,347,008
6Mar 19, 2026 23:035,76176,302,77945,823,0001,992,0002,506,752