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 16:38Bernard TeoBernard TeoScore: 958,409Success
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 16:38954,6877,889,095,2417,828,437,42602,293,760
2Sep 7, 2022 16:38958,4097,930,945,3387,858,954,34402,293,760
3Sep 7, 2022 16:38963,5807,958,373,1627,901,358,50302,281,472