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:01Karthik ReddyKarthik ReddyScore: 3,273Success
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:023,2683,036,182,62827,128,000020,480
2Oct 2, 2026 07:023,2703,036,181,07627,148,000020,480
3Oct 2, 2026 07:023,2713,036,244,49227,154,000020,480
4Oct 2, 2026 07:023,2723,036,278,55826,141,0001,018,00020,480
5Oct 2, 2026 07:023,2733,036,233,03127,173,000020,480
6Oct 2, 2026 07:023,2753,036,575,53626,177,0001,011,00020,480
7Oct 2, 2026 07:023,2763,036,247,67526,170,0001,022,00020,480
8Oct 2, 2026 07:023,2853,036,392,60326,262,0001,004,00020,480
9Oct 2, 2026 07:023,2873,036,342,32826,183,0001,106,00020,480