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 listMar 23, 2026 18:37izotoffizotoffScore: 24,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 18:3724,295226,469,211198,220,0001,001,0002,293,760
2Mar 23, 2026 18:3724,366223,602,360195,806,0003,996,0002,326,528
3Mar 23, 2026 18:3724,386229,596,526198,966,000999,0002,326,528
4Mar 23, 2026 18:3724,441228,117,461199,418,0001,002,0002,293,760
5Mar 23, 2026 18:3724,611228,539,418199,811,0001,998,0002,555,904
6Mar 23, 2026 18:3724,733230,942,332200,816,0001,998,0002,551,808
7Mar 23, 2026 18:3724,953231,259,605202,606,0002,006,0002,330,624
8Mar 23, 2026 18:3725,042229,653,965203,342,0002,003,0002,330,624
9Mar 23, 2026 18:3725,134227,330,278204,096,0002,000,0002,326,528