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 9, 2026 07:51Pavel 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 9, 2026 07:52053,245,52131,290,0007,776,000376,832Exit with code 101: thread 'main' (1) panicked at main.rs:179:9: assertion failed: less <= 50000000 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 9, 2026 07:526,34669,572,60443,489,0008,550,0002,428,928
3May 9, 2026 07:526,40066,180,64343,607,0008,874,0002,326,528
4May 9, 2026 07:526,44468,140,53143,979,0008,865,0002,342,912
5May 9, 2026 07:526,45770,107,31743,896,0009,054,0002,486,272
6May 9, 2026 07:526,53366,983,32744,442,0009,136,0002,347,008
7May 9, 2026 07:526,70269,718,66545,381,0009,577,0002,510,848