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:29Karthik ReddyKarthik ReddyScore: 3,274Success
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:293,2613,036,195,80527,069,000020,480
2Oct 2, 2026 06:293,2663,036,207,21627,109,000020,480
3Oct 2, 2026 06:293,2703,036,197,67727,144,000020,480
4Oct 2, 2026 06:293,2703,036,217,74127,145,000020,480
5Oct 2, 2026 06:293,2743,036,341,64926,160,0001,015,00020,480
6Oct 2, 2026 06:293,2743,036,234,34727,177,000020,480
7Oct 2, 2026 06:293,2753,036,537,25427,185,000020,480
8Oct 2, 2026 06:293,2893,036,249,74226,260,0001,045,00020,480
9Oct 2, 2026 06:293,2983,036,451,39027,374,000020,480