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 12:20Karthik 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 12:203,2313,036,041,02926,818,000020,480
2Oct 2, 2026 12:203,2403,036,086,43626,896,000020,480
3Oct 2, 2026 12:203,2453,036,117,79926,941,000020,480
4Oct 2, 2026 12:203,2503,036,100,57726,979,000020,480
5Oct 2, 2026 12:203,2503,036,142,71226,978,000020,480
6Oct 2, 2026 12:203,2633,036,175,56327,091,000020,480
7Oct 2, 2026 12:203,2643,036,232,63626,085,0001,013,00020,480
8Oct 2, 2026 12:203,2703,036,769,98727,143,000020,480
9Oct 2, 2026 12:203,6283,047,799,93929,045,0001,070,00020,480