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 26, 2023 14:31mmalczakmmalczakError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 14:3000000Error: expected "2241145318 ", got "954777828 "stderr
2Nov 26, 2023 14:3100000Error: No answer to stdout. Died or killed?stderr
3Nov 26, 2023 14:3157,269525,651,999469,605,27302,187,264
4Nov 26, 2023 14:3157,737534,404,221473,443,21702,174,976
5Nov 26, 2023 14:3159,429545,316,366487,321,73902,174,976