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 listApr 19, 2024 10:58Joad NacerJoad NacerScore: 1,946,343Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2024 10:581,873,54217,815,552,44015,363,046,61202,191,360
2Apr 19, 2024 10:581,946,34318,389,041,99215,960,011,13802,244,608
3Apr 19, 2024 10:581,956,17718,474,770,33716,040,651,64102,285,568