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 listSep 20, 2022 04:27Kenneth MaplesKenneth MaplesScore: 959,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2022 04:27959,0987,921,776,2637,864,606,48902,285,568
2Sep 20, 2022 04:27959,4797,932,262,0957,867,727,26502,289,664
3Sep 20, 2022 04:27964,9357,968,302,7667,912,465,98702,285,568