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 listAug 7, 2022 11:09Franek KortaFranek KortaScore: 975,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2022 11:09974,4168,044,926,0457,990,211,46202,293,760
2Aug 7, 2022 11:09975,9008,052,591,6248,002,376,96002,285,568
3Aug 7, 2022 11:09976,3928,082,759,9638,006,415,22502,289,664