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 22, 2022 15:52Bernard TeoBernard TeoError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2022 15:5200000Error: expected "2339023466 ", got "1"
2Nov 22, 2022 15:5200000Error: expected "2301963207 ", got "1"
3Nov 22, 2022 15:5200000Error: expected "2103098647 ", got "2"
4Nov 22, 2022 15:525,746120,333,43847,114,19402,301,952
5Nov 22, 2022 15:525,755121,898,80047,188,30502,306,048
6Nov 22, 2022 15:525,782108,677,84847,414,73902,301,952