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 listMay 20, 2024 22:37Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2024 22:3700000Error: expected "2213248571 ", got "0"stderr
2May 20, 2024 22:3800000Error: expected "2149573422 ", got "2145389388"
3May 20, 2024 22:3800000Error: No answer to stdout. Died or killed?
4May 20, 2024 22:3800000Error: expected "2133535878 ", got "2129291327"
5May 20, 2024 22:3800000Error: No answer to stdout. Died or killed?
6May 20, 2024 22:3800000Error: expected "2189670792 ", got "2189919030"