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 listJun 23, 2024 21:35Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 21:3500000Error: Exit with code 101: seek: 961ns mmap: 1.144448ms lower: 2145386496/499609 upper: 2149580800/500709 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 169745 ...stderr
2Jun 23, 2024 21:3500000Error: Exit with code 101: seek: 1.089µs mmap: 1.145998ms lower: 2092957696/499452 upper: 2098200576/500724 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 1844...stderr
3Jun 23, 2024 21:374,962104,610,13040,692,20202,220,032
4Jun 23, 2024 21:375,066107,014,47341,543,07002,252,800
5Jun 23, 2024 21:375,088106,664,86441,718,93502,248,704