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:43Franek KortaFranek KortaScore: 65,690Success
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:4362,670570,461,184513,893,09802,256,896
2Aug 7, 2022 11:4365,690620,215,981538,661,27502,199,552
3Aug 7, 2022 11:4366,383611,458,597544,336,62902,269,184