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 listApr 18, 2026 15:51Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:57042,683,04033,654,0001,101,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 6, 2026 23:57042,412,12233,276,0001,019,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 6, 2026 23:57042,197,28232,878,0001,203,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:514,30159,630,75734,679,0001,019,0002,478,080
5Apr 18, 2026 15:514,31765,948,31233,842,0001,990,0002,473,984
6Apr 18, 2026 15:514,31761,316,84734,835,000995,0002,535,424