Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listNov 11, 2024 10:52Matt StuchlikMatt StuchlikError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 10:5100000Error: No answer to stdout. Died or killed?stderr
2Nov 11, 2024 10:518,63995,925,44765,852,0004,988,0002,502,656
3Nov 11, 2024 10:529,323102,633,99570,411,0006,035,0002,514,944
4Nov 11, 2024 10:529,687103,329,75274,409,0005,027,0002,473,984
5Nov 11, 2024 10:519,739108,919,05675,867,0003,993,0002,408,448
6Nov 11, 2024 10:529,919104,130,03377,317,0004,016,0002,498,560
7Nov 11, 2024 10:5210,055107,185,01978,431,0004,022,0002,531,328
8Nov 11, 2024 10:5210,295107,020,72575,378,0009,045,0002,510,848
9Nov 11, 2024 10:5210,339109,223,74580,789,0003,989,0002,445,312
10Nov 11, 2024 10:5110,923122,509,44683,529,0006,038,0002,383,872