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:08Karthik ReddyKarthik ReddyScore: 3,319Success
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:093,2986,036,540,53127,379,000020,480
2Oct 2, 2026 01:093,3076,036,657,90927,453,000020,480
3Oct 2, 2026 01:093,3126,036,593,37027,492,000020,480
4Oct 2, 2026 01:093,3176,036,864,99926,504,0001,028,00020,480
5Oct 2, 2026 01:093,3196,036,780,65927,551,000020,480
6Oct 2, 2026 01:093,3196,036,785,68326,544,0001,005,00020,480
7Oct 2, 2026 01:093,3206,036,914,43226,557,0001,004,00020,480
8Oct 2, 2026 01:093,3286,036,727,19727,630,000020,480
9Oct 2, 2026 01:093,3296,036,889,95527,636,000020,480