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:06Karthik ReddyKarthik ReddyScore: 3,311Success
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:073,2963,036,844,35227,364,000020,480
2Oct 2, 2026 01:073,3073,036,558,65527,451,000020,480
3Oct 2, 2026 01:073,3093,036,395,52527,472,000020,480
4Oct 2, 2026 01:073,3093,037,073,34927,472,000020,480
5Oct 2, 2026 01:073,3113,036,459,07427,486,000020,480
6Oct 2, 2026 01:073,3153,036,660,25726,507,0001,014,00020,480
7Oct 2, 2026 01:073,3153,036,973,89927,518,000020,480
8Oct 2, 2026 01:073,3363,036,789,54426,645,0001,047,00020,480
9Oct 2, 2026 01:073,3653,037,064,79027,935,000020,480