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 18:05Yurkov AlekseyYurkov AlekseyScore: 132,488Success
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 18:05132,0651,143,121,4301,082,933,05202,289,664
2Jun 13, 2021 18:05132,4881,154,085,7241,086,400,92802,297,856
3Jun 13, 2021 18:05134,6811,162,229,3371,104,386,24502,289,664