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:32Pavel SkripkinPavel SkripkinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 5, 2026 21:26Andrew Epstein10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 21:30045,658,43130,906,0005,161,00024,576Exit with code 101: thread 'main' (1) panicked at main.rs:174:9: assertion failed: less <= 50000000 note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 7, 2026 20:325,52360,292,29737,580,0007,714,0002,314,240
3May 7, 2026 20:325,53161,577,49537,345,0008,011,0002,457,600
4May 7, 2026 20:325,64264,360,83937,995,0008,277,0002,543,616
5May 7, 2026 20:325,75162,916,45738,478,0008,688,0002,457,600
6May 7, 2026 20:325,75863,649,90338,569,0008,651,0002,441,216
7May 7, 2026 20:325,79361,075,00039,042,0008,464,0002,473,984
8May 7, 2026 20:325,89062,864,92439,303,0009,000,0002,478,080
9May 7, 2026 20:325,94866,601,26139,250,0009,529,0002,514,944
10May 7, 2026 20:326,31665,960,45341,304,00010,494,0002,514,944