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 3, 2026 01:00Karthik ReddyKarthik ReddyScore: 2,684Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 3, 2026 01:002,48029,309,89220,337,000020,480
2Oct 3, 2026 01:002,55830,012,82219,941,0001,036,00020,480
3Oct 3, 2026 01:002,59730,352,89820,097,0001,205,00020,480
4Oct 3, 2026 01:002,64030,702,72120,172,0001,481,00020,480
5Oct 3, 2026 01:002,68431,070,54620,245,0001,769,00020,480
6Oct 3, 2026 01:002,70031,197,34120,317,0001,830,00020,480
7Oct 3, 2026 01:002,76631,759,72620,438,0002,247,00020,480
8Oct 3, 2026 01:002,93733,094,69019,652,0004,435,00020,480
9Oct 3, 2026 01:005,01750,054,94939,379,0001,763,00020,480