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:29Anirudha SarafAnirudha SarafScore: 2,046,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:322,043,51216,972,290,57316,897,118,00064,036,00020,480
2Oct 31, 2026 11:322,045,20116,986,988,87416,909,092,00066,080,00020,480
3Oct 31, 2026 11:322,045,29116,987,939,89416,908,871,00067,045,00020,480
4Oct 31, 2026 11:322,045,96516,993,328,25916,916,477,00065,034,0002,113,536
5Oct 31, 2026 11:322,046,38416,996,118,58616,919,944,00065,046,00020,480
6Oct 31, 2026 11:322,046,60616,998,660,82816,920,700,00066,134,0002,113,536
7Oct 31, 2026 11:322,047,44117,004,893,10516,928,545,00065,221,0002,113,536
8Oct 31, 2026 11:322,117,24217,584,338,95717,509,073,00064,039,00020,480
9Oct 31, 2026 11:322,234,98118,561,487,31718,485,305,00065,038,00020,480