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 listMay 2, 2026 12:48Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2026 12:49093,477,44476,675,0001,008,0002,387,968expected "2175916401 ", got "0 "stderr
2May 2, 2026 12:49092,707,63572,280,0004,015,000225,280Exit with code 101: 52148706 548220 thread 'main' (1) panicked at main.rs:121:9: assertion failed: less < 50000000 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr