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 9, 2026 21:14Karthik ReddyKarthik ReddyScore: 3,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:153,2963,036,486,78827,361,000020,480
2Oct 9, 2026 21:153,3143,036,708,71327,509,000020,480
3Oct 9, 2026 21:153,3163,037,015,21327,523,000020,480
4Oct 9, 2026 21:153,3183,036,578,80527,541,000020,480
5Oct 9, 2026 21:153,3333,036,729,49227,669,000020,480
6Oct 9, 2026 21:153,3413,036,654,81426,727,0001,005,00020,480
7Oct 9, 2026 21:153,3433,036,798,80227,754,000020,480
8Oct 9, 2026 21:153,3533,037,378,95127,836,000020,480
9Oct 9, 2026 21:153,3733,037,120,45527,996,000020,480