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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:27045,054,18135,952,0001,202,0002,117,632expected "74600294196621100 ", got "14969816034029356 "
2Jul 7, 2026 03:27045,731,62835,941,0001,206,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:27045,034,08835,941,0001,212,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 31, 2026 13:044,67866,054,40637,829,000995,0002,535,424
5Mar 31, 2026 13:044,88267,017,47839,510,0001,013,0002,465,792
6Mar 31, 2026 13:044,92665,317,07738,892,0001,994,0002,473,984