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 22, 2023 08:53Franek KortaFranek KortaScore: 18,283Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2023 08:5317,596202,582,792144,284,94002,236,416
2May 22, 2023 08:5318,283207,703,711149,921,23802,183,168
3May 22, 2023 08:5318,319202,728,602150,218,55902,220,032