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 listOct 16, 2022 11:03Jules MinierJules MinierScore: 75,373Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2022 11:0372,576653,824,615595,122,85102,301,952
2Oct 16, 2022 11:0375,373679,312,149618,054,71402,174,976
3Oct 16, 2022 11:0387,360778,100,175716,352,14102,297,856