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 13, 2026 14:31caandocaandoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
May 17, 2026 15:11M-Rochat10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 15:32044,446,59731,918,0001,271,0002,113,536expected "11318049299365247 ", got "53093524049695335 "
2May 17, 2026 15:32043,707,73832,895,0001,208,0002,113,536expected "11318049299365247 ", got "53093524049695335 "
3May 17, 2026 15:32045,776,50832,579,0001,023,0002,113,536expected "11318049299365247 ", got "53093524049695335 "
4Mar 13, 2026 14:314,59859,804,86137,162,0001,004,0002,486,272
5Mar 13, 2026 14:574,59866,145,73937,163,0001,004,0002,482,176
6Mar 13, 2026 14:574,60461,753,36235,200,0003,017,0002,486,272
7Mar 13, 2026 14:314,60765,032,72336,227,0002,012,0002,338,816
8Mar 13, 2026 14:314,63364,700,68837,442,0001,011,0002,277,376
9Mar 13, 2026 14:574,97265,300,06738,251,0003,019,0002,486,272