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 11:44Karthik ReddyKarthik ReddyScore: 3,247Success
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 11:453,2403,036,033,23626,893,000020,480
2Oct 2, 2026 11:453,2423,036,070,92926,909,000020,480
3Oct 2, 2026 11:453,2443,036,005,35026,928,000020,480
4Oct 2, 2026 11:453,2453,036,140,85726,938,000020,480
5Oct 2, 2026 11:453,2473,036,148,98026,954,000020,480
6Oct 2, 2026 11:453,2483,036,063,36225,951,0001,010,00020,480
7Oct 2, 2026 11:453,2513,036,100,31826,986,000020,480
8Oct 2, 2026 11:453,2603,036,121,89127,065,000020,480
9Oct 2, 2026 11:453,2633,036,470,68327,083,000020,480