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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:10044,273,77834,989,0001,123,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 03:10045,986,26535,039,0001,214,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 03:10044,336,53635,021,0001,140,0002,117,632expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 17:574,57962,670,70737,005,0001,000,0002,465,792
5Mar 18, 2026 17:574,70868,902,78637,072,0002,003,0002,478,080
6Mar 18, 2026 17:574,76965,418,18638,568,0001,014,0002,531,328