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 listOct 31, 2026 11:21Anirudha SarafAnirudha SarafScore: 19,570Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 31, 2026 13:10Andrew Epstein25.41CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:2119,545173,046,173159,094,0003,135,00020,480
2Oct 31, 2026 11:2119,549172,958,264159,060,0003,202,00020,480
3Oct 31, 2026 11:2119,560173,920,081159,077,0003,279,00020,480
4Oct 31, 2026 11:2119,568173,166,297159,048,0003,367,00020,480
5Oct 31, 2026 11:2119,570173,183,161159,172,0003,263,00020,480
6Oct 31, 2026 11:2119,570173,223,643159,042,0003,397,00020,480
7Oct 31, 2026 11:2119,588173,369,747159,149,0003,437,00020,480
8Oct 31, 2026 11:2119,593173,423,960159,070,0003,559,00020,480
9Oct 31, 2026 11:2119,638173,892,284159,148,0003,853,0002,113,536