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 14:45Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:02052,820,01543,846,0001,024,0002,117,632expected "74600294196621100 ", got "15171666185858860 "
2Jul 7, 2026 05:02056,679,26843,820,0001,207,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 05:02053,069,33143,289,0001,188,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 14:455,46773,426,21144,371,0001,008,0002,473,984
5Mar 31, 2026 14:455,48872,628,92644,538,0001,012,0002,478,080
6Mar 31, 2026 14:455,54476,672,83244,014,0002,000,0002,478,080