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:19Karthik 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:213,2353,035,962,33926,856,000020,480
2Oct 2, 2026 15:213,2403,035,947,90126,900,000020,480
3Oct 2, 2026 15:213,2413,036,016,35726,905,000020,480
4Oct 2, 2026 15:213,2433,035,981,97226,924,000020,480
5Oct 2, 2026 15:213,2493,036,096,82726,972,000020,480
6Oct 2, 2026 15:213,2543,036,083,55227,016,000020,480
7Oct 2, 2026 15:213,2583,036,390,10727,042,000020,480
8Oct 2, 2026 15:213,2623,036,171,59426,028,0001,052,00020,480
9Oct 2, 2026 15:213,2643,036,151,68326,059,0001,034,00020,480