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 27, 2021 19:50alex3dalex3dScore: 136,271Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 19:50134,1141,155,210,4551,099,735,31902,301,952
2Jun 27, 2021 19:50136,2711,175,441,0651,117,421,85702,297,856
3Jun 27, 2021 19:50157,7511,348,734,1071,293,559,78102,306,048