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 22, 2026 22:31M-RochatM-RochatScore: 5,885Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 22:325,52954,730,15442,187,0003,153,0002,113,536
2May 22, 2026 22:325,58357,173,84242,673,0003,111,0002,113,536
3May 22, 2026 22:325,59456,490,43342,468,0003,410,0002,113,536
4May 22, 2026 22:325,67557,773,56543,207,0003,335,0002,113,536
5May 22, 2026 22:325,88557,809,97845,079,0003,183,0002,113,536
6May 22, 2026 22:3217,549154,522,102139,534,0004,369,0002,113,536
7May 22, 2026 22:3217,705154,540,673140,644,0004,541,0002,113,536
8May 22, 2026 22:3217,753156,607,172141,044,0004,536,0002,117,632
9May 22, 2026 22:3217,871160,534,755142,035,0004,508,0002,117,632