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 listOct 9, 2026 03:33highload-churnerhighload-churnerScore: 23,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 03:3422,864198,112,666186,485,0001,006,0002,117,632
2Oct 9, 2026 03:3422,883198,726,074186,642,0001,004,0002,113,536
3Oct 9, 2026 03:3423,003199,224,059187,623,0001,005,0002,117,632
4Oct 9, 2026 03:3423,004199,194,721187,634,0001,005,0002,113,536
5Oct 9, 2026 03:3423,042199,530,052187,940,0001,005,0002,117,632
6Oct 9, 2026 03:3423,101200,021,947188,425,0001,005,0002,113,536
7Oct 9, 2026 03:3423,360202,086,511190,555,0001,005,0002,117,632
8Oct 9, 2026 03:3423,532204,216,057191,962,0001,006,0002,113,536
9Oct 9, 2026 03:3424,965215,673,439203,711,0001,005,0002,113,536