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 11:32wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:03041,415,34632,146,0001,171,0002,113,536expected "74600294196621100 ", got "73528304991880236 "
2Jul 6, 2026 23:03043,411,30434,107,0001,176,0002,113,536expected "74600294196621100 ", got "73598112942582060 "
3Jul 6, 2026 23:03041,319,91132,128,0001,154,0002,113,536expected "74600294196621100 ", got "73530263575295020 "
4Mar 18, 2026 11:324,25360,583,63534,288,0001,008,0002,269,184
5Mar 18, 2026 11:324,27658,409,86934,474,0001,013,0002,273,280
6Mar 18, 2026 11:324,27755,426,00134,485,0001,014,0002,486,272