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 01:04Karthik ReddyKarthik ReddyScore: 3,317Success
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 01:053,3006,036,694,47127,392,000020,480
2Oct 2, 2026 01:053,3066,036,639,29427,443,000020,480
3Oct 2, 2026 01:053,3066,036,805,92727,447,000020,480
4Oct 2, 2026 01:053,3096,036,716,63927,465,000020,480
5Oct 2, 2026 01:053,3176,036,753,40427,536,000020,480
6Oct 2, 2026 01:053,3176,036,702,02027,536,000020,480
7Oct 2, 2026 01:053,3186,036,859,86326,538,0001,008,00020,480
8Oct 2, 2026 01:053,3196,036,764,93027,550,000020,480
9Oct 2, 2026 01:053,3246,036,829,35627,591,000020,480