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 listApr 23, 2023 20:57Franek 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
1Apr 23, 2023 20:5400000Error: No answer to stdout. Died or killed?stderr
2Apr 23, 2023 20:5717,879221,572,711146,608,00902,236,416
3Apr 23, 2023 20:5717,928214,216,382147,010,23002,183,168
4Apr 23, 2023 20:5718,115205,560,312148,546,01102,191,360