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 07:12Karthik ReddyKarthik ReddyScore: 3,277Success
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 07:123,26936,148,78627,139,000020,480
2Oct 2, 2026 07:123,27136,144,18327,155,000020,480
3Oct 2, 2026 07:123,27136,128,64927,155,000020,480
4Oct 2, 2026 07:123,27236,218,89327,164,000020,480
5Oct 2, 2026 07:123,27736,342,29527,205,000020,480
6Oct 2, 2026 07:123,28236,346,13927,248,000020,480
7Oct 2, 2026 07:123,28236,173,90126,248,0001,000,00020,480
8Oct 2, 2026 07:123,30036,427,69826,323,0001,071,00020,480
9Oct 2, 2026 07:123,30640,517,73126,403,0001,041,00020,480