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 15:39Karthik ReddyKarthik ReddyScore: 3,249Success
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 15:413,2243,035,874,03126,765,000020,480
2Oct 2, 2026 15:413,2373,035,990,53926,873,000020,480
3Oct 2, 2026 15:413,2413,036,028,06326,903,000020,480
4Oct 2, 2026 15:413,2433,036,098,58426,919,000020,480
5Oct 2, 2026 15:413,2493,035,959,31326,968,000020,480
6Oct 2, 2026 15:413,2533,036,083,79325,989,0001,013,00020,480
7Oct 2, 2026 15:413,2543,036,075,59025,991,0001,019,00020,480
8Oct 2, 2026 15:413,2583,036,024,28927,046,000020,480
9Oct 2, 2026 15:413,3133,036,661,08127,503,000020,480