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 listMar 7, 2023 20:35Franek KortaFranek KortaScore: 49,626Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 7, 2023 20:3549,554459,673,816406,346,46502,183,168
2Mar 7, 2023 20:3549,626469,195,424406,930,19402,224,128
3Mar 7, 2023 20:3550,063466,356,343410,518,77702,301,952