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 16, 2025 15:51Kirill020708Kirill020708Score: 410,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2025 15:51410,7613,435,636,3903,335,353,00073,963,0002,281,472
2Oct 16, 2025 15:51410,8053,440,077,2903,323,742,00085,941,0002,506,752
3Oct 16, 2025 15:51410,8463,434,612,7543,336,067,00073,957,0002,519,040
4Oct 16, 2025 15:51410,9283,436,098,2443,335,757,00074,949,0002,289,664
5Oct 16, 2025 15:51410,9863,439,208,1203,345,216,00065,964,0002,281,472
6Oct 16, 2025 15:51411,1303,439,874,6093,345,410,00066,968,0002,289,664
7Oct 16, 2025 15:51411,2093,435,640,7153,336,081,00076,955,0002,281,472
8Oct 16, 2025 15:51411,4863,442,574,1793,330,378,00084,958,0002,281,472
9Oct 16, 2025 15:51411,5053,442,734,1533,347,521,00067,969,0002,281,472