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:41mmalczakmmalczakError
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:3700000Error: No answer to stdout. Died or killed?stderr
2Nov 26, 2023 14:4000000Error: expected "2282679218 ", got "530404240 "stderr
3Nov 26, 2023 14:4172,644651,509,773595,677,72702,174,976
4Nov 26, 2023 14:4175,105684,515,538615,861,59202,179,072
5Nov 26, 2023 14:4178,416697,102,256643,009,92502,174,976