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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:58043,733,71333,587,0001,118,0002,117,632expected "74600294196621100 ", got "22348441450622764 "
2Jul 6, 2026 23:58042,835,07033,640,0001,084,0002,117,632expected "74600294196621100 ", got "20785990392802192 "
3Jul 6, 2026 23:58042,635,79333,638,0001,090,0002,117,632expected "74600294196621100 ", got "20598630250622764 "
4Apr 18, 2026 15:554,28864,979,98634,574,0001,016,0002,310,144
5Apr 18, 2026 15:554,31767,213,37034,840,000995,0002,465,792
6Apr 18, 2026 15:554,31958,795,49333,859,0001,991,0002,535,424