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 7, 2022 17:28eldon-chungeldon-chungScore: 48,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2022 17:2847,811452,736,300392,052,95602,248,704
2Sep 7, 2022 17:2848,107459,705,114394,475,81402,285,568
3Sep 7, 2022 17:2848,132452,964,116394,683,17302,297,856
4Sep 7, 2022 17:2848,830460,683,051400,409,03202,228,224
5Sep 7, 2022 17:2849,033476,676,194402,069,79902,203,648
6Sep 7, 2022 17:2849,943483,389,851409,534,79502,285,568