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 listNov 4, 2026 04:51e1011e1011Score: 129,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 04:52100,300833,472,739660,995,000161,466,0002,113,536
2Nov 4, 2026 04:52122,3861,014,515,663843,853,000159,716,0002,113,536
3Nov 4, 2026 04:52125,8401,042,858,659873,479,000158,415,0002,113,536
4Nov 4, 2026 04:52126,0751,045,228,421874,583,000159,235,0002,113,536
5Nov 4, 2026 04:52129,5461,073,137,302902,904,000159,375,0002,113,536
6Nov 4, 2026 04:52132,6811,098,878,769927,712,000160,276,0002,113,536
7Nov 4, 2026 04:52174,2561,439,873,8721,268,311,000160,594,0002,113,536
8Nov 4, 2026 04:52175,1961,448,050,0201,276,684,000159,931,0002,117,632
9Nov 4, 2026 04:52176,9611,462,137,2851,294,013,000157,069,0002,113,536