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 13, 2021 19:34Yurkov AlekseyYurkov AlekseyScore: 133,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2021 19:34104,076914,374,903853,422,07102,293,760
2Jun 13, 2021 19:34133,4301,168,117,7651,094,127,91202,289,664
3Jun 13, 2021 19:34146,6411,260,013,0551,202,459,09402,297,856