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 18, 2026 03:28Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:23048,748,99636,445,0001,017,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:23048,127,58537,427,0001,016,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:23047,015,95736,423,0001,017,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 03:274,72563,844,27936,204,0003,017,0002,301,952
5Mar 18, 2026 03:274,73669,645,76637,292,0002,015,0002,297,856
6Mar 18, 2026 03:284,76971,178,91037,556,0002,030,0002,285,568
7Mar 18, 2026 03:284,82565,655,36637,042,0003,003,0002,285,568
8Mar 18, 2026 03:284,83471,546,14538,116,0002,006,0002,306,048
9Mar 18, 2026 03:274,84264,595,21338,180,0002,009,0002,392,064