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 20:46Andrey LikhachevAndrey LikhachevError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:21Tomislav Tunkovic172.86CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:2101,918,430,95533,695,000329,174,00024,576Exit with code 101: seek: 1.22µs mmap: 1.867671718s lower: 5242880/1000000 upper: 5242880/1000000 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 50000000 great...stderr
2Jun 23, 2024 20:465,41499,626,81244,395,59002,248,704
3Jun 23, 2024 20:465,420124,315,36844,440,51602,301,952
4Jun 23, 2024 20:465,426111,534,90544,491,04002,318,336