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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:57045,028,78434,946,0001,126,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
2Jul 7, 2026 01:57044,156,10535,141,0001,152,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
3Jul 7, 2026 01:57044,174,50135,201,0001,117,0002,117,632expected "74600294196621100 ", got "15414004478029612 "
4Apr 13, 2026 18:524,51362,982,26036,447,0001,012,0002,469,888
5Apr 13, 2026 18:524,52465,184,67036,535,0001,014,0002,465,792
6Apr 13, 2026 18:524,56162,697,92735,868,0001,992,0002,478,080