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 listMar 18, 2026 17:56Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:22045,196,99835,965,0001,188,0002,117,632expected "74600294196621100 ", got "15128413154029356 "
2Jul 7, 2026 03:22045,233,80135,911,0001,182,0002,117,632expected "74600294196621100 ", got "15171594095738912 "
3Jul 7, 2026 03:22045,167,38135,983,0001,185,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 17:564,79970,163,09638,835,000995,0002,461,696
5Mar 18, 2026 17:564,80066,598,27137,850,0001,992,0002,531,328
6Mar 18, 2026 17:564,80068,304,15938,846,000996,0002,531,328