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 4, 2023 21:43Franek 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
1Jun 4, 2023 21:4200000Error: No answer to stdout. Died or killed?stderr
2Jun 4, 2023 21:4313,534182,622,141110,980,84002,297,856
3Jun 4, 2023 21:4314,544178,252,953119,263,86902,236,416
4Jun 4, 2023 21:4315,140181,555,162124,147,11002,215,936