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 listMay 6, 2023 22:33Franek KortaFranek KortaScore: 15,366Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2023 22:3315,364189,444,827125,982,43702,293,760
2May 6, 2023 22:3315,366180,676,074125,997,99302,301,952
3May 6, 2023 22:3315,866190,382,299130,104,40602,236,416