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 9, 2023 21:29Franek KortaFranek KortaScore: 14,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2023 21:2914,551177,832,326119,314,85202,240,512
2May 9, 2023 21:2914,791189,944,358121,287,83102,215,936
3May 9, 2023 21:2917,001208,320,376139,406,61302,211,840