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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:54044,388,93835,316,0001,185,0002,117,632expected "74600294196621100 ", got "15644981740941100 "
2Jul 7, 2026 01:54044,021,80535,060,0001,106,0002,117,632expected "74600294196621100 ", got "15644981740460158 "
3Jul 7, 2026 01:54044,225,75335,244,0001,112,0002,117,632expected "74600294196621100 ", got "17356782789111596 "
4Apr 13, 2026 18:514,50360,785,27736,364,0001,010,0002,535,424
5Apr 13, 2026 18:514,51161,606,62836,432,0001,012,0002,535,424
6Apr 13, 2026 18:514,55764,494,15435,836,0001,990,0002,473,984