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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:54052,881,78436,427,0006,837,0002,117,632expected "74600294196621100 ", got "36656797418827820 "
2Jul 7, 2026 05:54052,917,10836,752,0006,520,0002,117,632expected "74600294196621100 ", got "47051094376542764 "
3Jul 7, 2026 05:54053,206,18536,297,0007,400,0002,117,632expected "74600294196621100 ", got "36675079468073260 "
4Mar 21, 2026 07:055,76479,213,52945,847,0001,993,0002,527,232
5Mar 21, 2026 07:055,80169,634,72045,137,0003,009,0002,514,944
6Mar 21, 2026 07:055,85175,625,12146,540,0002,023,0002,318,336