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 2, 2026 15:39Karthik ReddyKarthik ReddyScore: 3,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 15:403,2323,035,948,04325,829,0001,004,00020,480
2Oct 2, 2026 15:403,2373,035,972,75025,861,0001,007,00020,480
3Oct 2, 2026 15:403,2403,035,965,09625,891,0001,001,00020,480
4Oct 2, 2026 15:403,2443,036,138,07825,904,0001,028,00020,480
5Oct 2, 2026 15:403,2503,036,017,10925,893,0001,085,00020,480
6Oct 2, 2026 15:403,2513,036,164,53025,940,0001,046,00020,480
7Oct 2, 2026 15:403,2553,036,160,25025,884,0001,140,00020,480
8Oct 2, 2026 15:403,2593,036,479,25026,039,0001,013,00020,480
9Oct 2, 2026 15:403,2683,036,177,83426,106,0001,020,00020,480