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 31, 2026 14:47Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:29044,703,54535,499,0001,126,0002,117,632expected "74600294196621100 ", got "15171790704258860 "
2Jul 7, 2026 03:29045,518,15936,116,0001,251,0002,117,632expected "74600294196621100 ", got "14969816034029356 "
3Jul 7, 2026 03:29048,437,84835,338,0001,114,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 14:474,61266,682,00036,262,0002,014,0002,535,424
5Mar 31, 2026 14:474,88870,585,45939,559,0001,014,0002,535,424
6Mar 31, 2026 14:474,89871,478,45239,636,0001,016,0002,469,888