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 listNov 20, 2024 16:53Joad 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
1Nov 20, 2024 16:5000000Error: No answer to stdout. Died or killed?stderr
2Nov 20, 2024 16:5100000Error: No answer to stdout. Died or killed?stderr
3Nov 20, 2024 16:5200000Error: No answer to stdout. Died or killed?stderr
4Nov 20, 2024 16:5300000Error: No answer to stdout. Died or killed?stderr
5Nov 20, 2024 16:5300000Error: No answer to stdout. Died or killed?stderr
6Nov 20, 2024 16:534,40362,429,35032,095,0004,011,0002,277,376
7Nov 20, 2024 16:536,71278,598,74253,035,0002,001,0002,420,736
8Nov 20, 2024 16:536,90881,169,13353,610,0003,034,0002,277,376