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 listAug 2, 2024 20:13Andrey 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
1Aug 2, 2024 20:1300000Error: Exit with code 101: sum: 0 thread 'main' panicked at /rustc/9b00956e56009bab2aa15d7bff10916599e3d6d6/library/core/src/slice/select.rs:135:9: partition_at_index index 18446744073709500640 greater than length of slice 109868 note: run with `RUST_B...stderr
2Aug 2, 2024 20:143,45097,540,11128,290,28602,199,552
3Aug 2, 2024 20:143,480101,722,96528,538,83002,301,952
4Aug 2, 2024 20:143,486101,677,55928,583,72102,318,336