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:31Franek KortaFranek KortaScore: 16,577Success
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:3114,794181,577,394121,313,24502,179,072
2May 9, 2023 21:3116,577206,343,893135,930,94702,236,416
3May 9, 2023 21:3117,693198,982,322145,080,29102,252,800