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 listNov 25, 2023 22:38mmalczakmmalczakScore: 85,965Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 22:3884,277745,500,889691,070,14502,174,976
2Nov 25, 2023 22:3885,965768,055,799704,916,71402,174,976
3Nov 25, 2023 22:3891,140816,657,926747,346,81002,179,072