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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:03Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:03044,186,80533,516,0001,161,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 00:03042,612,30433,652,0001,088,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
3Jul 7, 2026 00:03042,727,52333,633,0001,227,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
4Apr 18, 2026 15:524,28564,527,95334,551,0001,016,0002,469,888
5Apr 18, 2026 15:524,31966,286,06634,855,000995,0002,273,280
6Apr 18, 2026 15:524,33160,589,65533,951,0001,997,0002,478,080