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 02:04Joad 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 02:0400000Error: No answer to stdout. Died or killed?stderr
2Dec 25, 2024 02:0500000Error: expected "2147430710 ", got "2071363975 "stderr
3Dec 25, 2024 02:0500000Error: expected "2069429213 ", got "2196166158 "stderr
4Dec 25, 2024 02:0600000Error: expected "2183810329 ", got "2067209456 "stderr
5Dec 25, 2024 02:0600000Error: expected "2181442051 ", got "2101279356 "stderr
6Dec 25, 2024 02:0600000Error: expected "2224316394 ", got "2091743121 "stderr