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 24, 2024 16:11Andrey 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 24, 2024 16:1300000Error: Exit with code 101: seek: 823ns mmap: 1.138006ms thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 109384 greater than length of slice 103935 note: run with...stderr
2Jun 24, 2024 16:113,883101,601,36331,838,77402,244,608
3Jun 24, 2024 16:113,89792,643,51031,953,43302,289,664
4Jun 24, 2024 16:113,93399,392,10132,249,89502,211,840