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 19, 2021 21:35alex3dalex3dScore: 137,683Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 21:35112,552989,536,746922,927,22902,318,336
2Jun 19, 2021 21:35137,6831,185,120,6921,128,997,52702,314,240
3Jun 19, 2021 21:35141,4751,213,245,3581,160,093,66902,297,856