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 listAug 20, 2026 23:26Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:50Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:54012,672,9182,212,000020,480No answer to stdout. Died or killed?
2Aug 20, 2026 23:266,46663,426,77552,644,0001,029,0002,113,536
3Aug 20, 2026 23:266,47164,786,41352,660,0001,057,0002,113,536
4Aug 20, 2026 23:266,47263,463,57252,703,0001,019,0002,113,536
5Aug 20, 2026 23:266,50563,746,43352,960,0001,034,0002,113,536
6Aug 20, 2026 23:266,51963,992,95053,003,0001,108,0002,113,536
7Aug 20, 2026 23:266,59864,541,50853,722,0001,043,0002,113,536
8Aug 20, 2026 23:266,64264,903,84654,106,0001,030,0002,113,536
9Aug 20, 2026 23:266,64364,841,27154,073,0001,064,0002,113,536
10Aug 20, 2026 23:266,64465,048,23654,115,0001,038,0002,113,536