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 29, 2021 15:39alex3dalex3dScore: 193,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 15:39170,2501,468,662,9171,396,051,58802,289,664
2Jun 29, 2021 15:39193,0941,643,401,2301,583,373,48302,281,472
3Jun 29, 2021 15:39206,9221,782,608,3131,696,759,01902,297,856