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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:31045,906,21235,964,0001,198,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:31045,206,70835,947,0001,201,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:31045,050,43735,981,0001,199,0002,117,632expected "74600294196621100 ", got "15171666185858860 "
4Mar 31, 2026 13:034,91869,819,95639,824,000995,0002,535,424
5Mar 31, 2026 13:034,92670,784,95839,861,0001,022,0002,465,792
6Mar 31, 2026 13:034,93864,786,44338,986,0001,999,0002,461,696