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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:41048,829,18738,227,0001,024,0002,113,536expected "74600294196621100 ", got "47053553668562220 "
2Jul 7, 2026 05:41048,467,26937,951,0001,024,0002,113,536expected "74600294196621100 ", got "47748935660416556 "
3Jul 7, 2026 05:41049,326,46938,807,0001,022,0002,113,536expected "74600294196621100 ", got "35632632377974828 "
4Mar 19, 2026 23:065,61282,473,13843,540,0003,037,0002,301,952
5Mar 19, 2026 23:065,76274,013,24147,823,00002,478,080
6Mar 19, 2026 23:065,82378,797,99046,317,0002,013,0002,482,176