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:50Franek KortaFranek KortaScore: 52,820Success
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:5050,035471,552,484410,285,13902,236,416
2Aug 7, 2022 11:5052,820494,714,045433,125,89202,248,704
3Aug 7, 2022 11:5053,705519,315,948440,380,29202,187,264