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 listMar 29, 2024 20:50Drew GarciaDrew GarciaScore: 73,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 20:5062,824576,400,316515,153,61802,273,280
2Mar 29, 2024 20:5073,793657,743,312605,102,13602,285,568
3Mar 29, 2024 20:5074,293670,757,353609,202,08002,277,376