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:55Yuriy 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,069,38732,748,0001,210,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 6, 2026 23:57042,230,80933,150,0001,180,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 6, 2026 23:57042,428,84133,458,0001,092,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:554,31461,992,85135,809,00002,469,888
5Apr 18, 2026 15:554,31765,165,49534,840,000995,0002,273,280
6Apr 18, 2026 15:554,31970,138,96534,856,000995,0002,478,080