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 06:24Karthik ReddyKarthik ReddyScore: 3,283Success
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 06:253,2573,036,156,16327,039,000020,480
2Oct 2, 2026 06:253,2733,036,207,02327,171,000020,480
3Oct 2, 2026 06:253,2763,036,336,51427,193,000020,480
4Oct 2, 2026 06:253,2803,036,288,00627,232,000020,480
5Oct 2, 2026 06:253,2833,036,432,31027,251,000020,480
6Oct 2, 2026 06:253,2843,036,328,51727,259,000020,480
7Oct 2, 2026 06:253,2863,036,417,81427,277,000020,480
8Oct 2, 2026 06:253,3033,036,485,87827,417,000020,480
9Oct 2, 2026 06:253,3683,037,028,29327,960,000020,480