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 11, 2025 13:23e1011e1011Score: 67,602Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2025 13:2367,336583,807,479493,902,00064,987,0002,281,472
2Oct 11, 2025 13:2367,448582,294,810492,838,00066,978,0002,510,848
3Oct 11, 2025 13:2367,460586,331,917491,052,00068,867,0002,494,464
4Oct 11, 2025 13:2367,581588,009,817492,934,00067,990,0002,289,664
5Oct 11, 2025 13:2367,602589,693,871494,202,00066,891,0002,510,848
6Oct 11, 2025 13:2367,614588,473,604494,171,00067,023,0002,375,680
7Oct 11, 2025 13:2367,651588,086,868494,566,00066,941,0002,260,992
8Oct 11, 2025 13:2367,693585,372,488492,869,00068,981,0002,437,120
9Oct 11, 2025 13:2368,923599,081,496499,050,00073,007,0002,510,848