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 18:42Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:22049,614,09640,486,0001,210,0002,117,632expected "74600294196621100 ", got "15171666185858860 "
2Jul 7, 2026 05:22052,183,95543,143,0001,020,0002,117,632expected "74600294196621100 ", got "14969816034029356 "
3Jul 7, 2026 05:22051,204,37541,976,0001,125,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 18:425,64473,440,38944,853,0001,993,0002,531,328
5Mar 18, 2026 18:425,65973,514,84344,973,0001,998,0002,269,184
6Mar 18, 2026 18:425,71374,587,94146,408,0001,008,0002,531,328