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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:02042,109,59733,111,0001,096,0002,117,632expected "74600294196621100 ", got "15382838469373740 "
2Jul 7, 2026 00:02041,977,78233,100,0001,020,0002,117,632expected "74600294196621100 ", got "15382837741203244 "
3Jul 7, 2026 00:02042,591,08633,440,0001,025,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 18, 2026 15:434,29462,657,14434,624,0001,018,0002,273,280
5Apr 18, 2026 15:434,31965,046,51034,851,000995,0002,273,280
6Apr 18, 2026 15:434,32659,323,25533,911,0001,994,0002,473,984