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:40Joad 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:4000000Error: expected "2286620267 ", got "2120329541 "stderr
2Dec 25, 2024 02:4200000Error: No answer to stdout. Died or killed?stderr
3Dec 25, 2024 02:4200000Error: expected "2308759733 ", got "2217134241 "stderr
4Dec 25, 2024 02:4200000Error: No answer to stdout. Died or killed?stderr
5Dec 25, 2024 02:4200000Error: expected "2348800198 ", got "2216188546 "stderr