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 listJun 13, 2021 15:44Yurkov AlekseyYurkov AlekseyScore: 91,687Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 15:4473,394676,235,316601,833,49102,301,952
2Jun 13, 2021 15:4491,687821,453,994751,830,86502,293,760
3Jun 13, 2021 15:4495,925854,927,406786,587,34202,174,976