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 12:32Franek KortaFranek KortaError
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 12:3000000Error: No answer to stdout. Died or killed?stderr
2Aug 7, 2022 12:3100000Error: No answer to stdout. Died or killed?stderr
3Aug 7, 2022 12:3200000Error: No answer to stdout. Died or killed?stderr
4Aug 7, 2022 12:3246,088448,680,815377,923,34202,265,088
5Aug 7, 2022 12:3248,266457,030,523395,784,66202,220,032
6Aug 7, 2022 12:3249,660474,529,860407,209,20302,301,952