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 listDec 25, 2024 19:57Joad 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
1Dec 25, 2024 19:5600000Error: No answer to stdout. Died or killed?stderr
2Dec 25, 2024 19:5600000Error: No answer to stdout. Died or killed?stderr
3Dec 25, 2024 19:5700000Error: No answer to stdout. Died or killed?stderr
4Dec 25, 2024 19:573,56051,591,43627,182,0002,013,0002,527,232
5Dec 25, 2024 19:573,63654,366,18027,831,0001,987,0002,412,544
6Dec 25, 2024 19:573,76256,308,17528,855,0001,990,0002,502,656