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:35Karthik ReddyKarthik ReddyScore: 3,251Success
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:363,2313,035,868,06126,825,000020,480
2Oct 2, 2026 15:363,2423,036,199,81726,910,000020,480
3Oct 2, 2026 15:363,2453,036,021,59525,921,0001,018,00020,480
4Oct 2, 2026 15:363,2483,036,084,41825,946,0001,016,00020,480
5Oct 2, 2026 15:363,2513,036,163,01625,966,0001,020,00020,480
6Oct 2, 2026 15:363,2513,036,049,81425,981,0001,003,00020,480
7Oct 2, 2026 15:363,2563,036,158,05326,022,0001,010,00020,480
8Oct 2, 2026 15:363,2603,036,144,69226,015,0001,051,00020,480
9Oct 2, 2026 15:363,2803,036,397,69326,201,0001,026,00020,480