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 18:42Yurkov AlekseyYurkov AlekseyScore: 41,335Success
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 18:4237,822370,493,101310,137,07302,174,976
2Jun 13, 2021 18:4241,335395,613,378338,943,35902,293,760
3Jun 13, 2021 18:4242,039422,861,782344,715,79602,293,760