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 listJun 2, 2023 21:28Franek KortaFranek KortaScore: 15,909Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 2, 2023 21:2814,660182,168,383120,213,62602,187,264
2Jun 2, 2023 21:2815,909184,142,375130,454,66402,256,896
3Jun 2, 2023 21:2816,346202,466,061134,037,77002,289,664