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 13:07Pavel 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 13:080125,875,534100,160,00011,017,000315,392Exit with code 101: thread 'main' (1) panicked at main.rs:121:9: assertion failed: 50000000 - less < i note: run with `RUST_BACKTRACE=1` environment variable to display a backtracestderr
2May 2, 2026 13:0814,163135,918,921108,133,0008,009,0002,433,024
3May 2, 2026 13:0814,180128,134,393110,264,0006,014,0002,428,928
4May 2, 2026 13:0814,231134,495,485109,715,0006,981,0002,523,136
5May 2, 2026 13:0814,590131,583,993114,613,0005,026,0002,342,912
6May 2, 2026 13:0814,646139,039,331115,095,0005,004,0002,469,888