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

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:21Tomislav Tunkovic30.06CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:21080,449,67760,008,00010,273,00024,576Exit with code 101: seek: 1.211µs mmap: 6.091411ms lower: 0/966125 upper: 0/966125 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 50000000 greater than length ...stderr
2Jun 23, 2024 21:424,609109,307,87237,796,13102,269,184
3Jun 23, 2024 21:424,647106,677,76538,104,84002,265,088
4Jun 23, 2024 21:424,658101,365,29538,192,96902,367,488