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 25, 2023 20:18mmalczakmmalczakScore: 169,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 20:18161,3661,394,924,4351,323,203,77502,179,072
2Nov 25, 2023 20:18169,2931,452,353,6081,388,203,07902,301,952
3Nov 25, 2023 20:18169,6311,455,325,3721,390,973,39502,179,072