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 listJan 2, 2026 04:30Josu San MartinJosu San MartinScore: 12,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:3012,049130,848,18196,805,0001,995,0002,461,696
2Dec 26, 2025 03:5412,060129,306,73197,893,000998,0002,461,696
3Dec 26, 2025 03:5412,061127,186,62396,906,0001,998,0002,506,752
4Dec 26, 2025 03:5412,065126,217,80397,931,000999,0002,367,488
5Dec 26, 2025 03:5412,065126,106,46097,935,000999,0002,494,464
6Dec 26, 2025 03:5412,065124,751,64196,938,0001,998,0002,478,080
7Dec 26, 2025 03:5412,068121,411,44996,961,0001,999,0002,510,848
8Jan 2, 2026 04:3012,068123,344,70197,962,000999,0002,506,752
9Dec 26, 2025 03:5412,070126,398,13897,976,000999,0002,510,848
10Dec 26, 2025 03:5412,073128,500,03796,998,0001,999,0002,490,368
11Dec 26, 2025 03:5412,074126,935,35298,009,0001,000,0002,445,312
12Jan 2, 2026 04:3012,098127,977,52598,203,0001,002,0002,433,024