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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:13045,479,26636,536,0001,008,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 7, 2026 03:13046,088,54637,111,0001,082,0002,117,632expected "74600294196621100 ", got "20785990392332320 "
3Jul 7, 2026 03:13045,977,35836,880,0001,012,0002,117,632expected "74600294196621100 ", got "20598630250622764 "
4Apr 18, 2026 15:574,68263,698,90537,837,0001,022,0002,469,888
5Apr 18, 2026 15:574,71261,687,68337,101,0002,005,0002,473,984
6Apr 18, 2026 15:574,72863,795,21037,232,0002,012,0002,478,080