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 00:33izotoffizotoffScore: 24,477Success
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 00:3324,184219,551,415196,304,0002,003,0002,326,528
2Mar 23, 2026 00:3324,243225,949,877196,799,0001,997,0002,334,720
3Mar 23, 2026 00:3324,272226,072,702196,031,0003,000,0002,330,624
4Mar 23, 2026 00:3324,462228,845,497197,580,0003,008,0002,555,904
5Mar 23, 2026 00:3324,477232,643,190198,717,0001,997,0002,326,528
6Mar 23, 2026 00:3324,479231,934,452197,734,0002,995,0002,547,712
7Mar 23, 2026 00:3324,653223,664,746199,152,0003,002,0002,326,528
8Mar 23, 2026 00:3324,683227,196,485201,398,0001,001,0002,326,528
9Mar 23, 2026 00:3324,959232,680,940201,670,0002,995,0002,326,528