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 15, 2026 03:55highload-churnerhighload-churnerScore: 21,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 15, 2026 03:5621,547185,728,049175,655,0001,038,00024,576stderr
2Oct 15, 2026 03:5621,552185,713,279175,707,0001,024,00024,576stderr
3Oct 15, 2026 03:5621,590186,038,943176,007,0001,033,00024,576stderr
4Oct 15, 2026 03:5621,595186,114,701176,040,0001,042,00024,576stderr
5Oct 15, 2026 03:5621,608186,169,872176,163,0001,025,00024,576stderr
6Oct 15, 2026 03:5621,610187,836,943176,153,0001,051,00024,576stderr
7Oct 15, 2026 03:5621,616186,261,387176,226,0001,030,00024,576stderr
8Oct 15, 2026 03:5651,409430,528,904397,832,00023,722,00028,672stderr
9Oct 15, 2026 03:5651,962435,117,599400,983,00025,106,00028,672stderr