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 07:34Karthik ReddyKarthik ReddyScore: 3,291Success
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 07:353,2363,035,997,19726,867,000020,480
2Oct 9, 2026 07:353,2363,035,897,60326,867,000020,480
3Oct 9, 2026 07:353,2513,036,102,38126,985,000020,480
4Oct 9, 2026 07:353,2903,036,340,93927,314,000020,480
5Oct 9, 2026 07:353,2913,036,355,70127,316,000020,480
6Oct 9, 2026 07:353,2953,036,415,04327,351,000020,480
7Oct 9, 2026 07:353,3013,036,428,10627,401,000020,480
8Oct 9, 2026 07:353,3033,036,493,71827,419,000020,480
9Oct 9, 2026 07:353,3103,036,540,40527,475,000020,480