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:31Franek KortaFranek KortaScore: 12,182Success
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:3111,714160,417,86096,057,54802,224,128
2May 6, 2023 22:3112,182161,916,31399,891,63602,224,128
3May 6, 2023 22:3113,058170,668,151107,073,13702,236,416