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:28Pavel 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:29060,210,66334,264,0009,583,000372,736Exit 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:295,53261,694,62238,049,0007,321,0002,543,616
3May 7, 2026 20:295,81062,847,49839,348,0008,302,0002,465,792
4May 7, 2026 20:295,87264,074,27039,673,0008,484,0002,461,696
5May 7, 2026 20:295,88363,903,38239,876,0008,369,0002,351,104
6May 7, 2026 20:295,91361,647,24940,027,0008,466,0002,334,720
7May 7, 2026 20:295,93864,178,87439,992,0008,702,0002,560,000
8May 7, 2026 20:295,94663,835,75340,014,0008,744,0002,408,448
9May 7, 2026 20:296,02264,148,71040,839,0008,548,0002,494,464