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 7, 2026 20:02Pavel 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 7, 2026 20:03065,453,08443,356,0008,130,000221,184Exit with code 101: thread 'main' (1) panicked at main.rs:183:9: assertion failed: 50000000 - less < i note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 7, 2026 20:037,07174,563,69450,125,0007,862,0002,318,336
3May 7, 2026 20:037,09975,041,41150,156,0008,062,0002,527,232
4May 7, 2026 20:037,12774,003,15950,562,0007,880,0002,473,984
5May 7, 2026 20:037,26677,038,39051,361,0008,223,0002,404,352
6May 7, 2026 20:037,29774,735,31751,113,0008,724,0002,445,312
7May 7, 2026 20:037,56474,002,75452,265,0009,763,0002,453,504