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 17:23Karthik ReddyKarthik ReddyScore: 2,541Success
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 17:442,53129,424,10620,756,000020,480
2Oct 9, 2026 17:442,53329,388,14020,772,000020,480
3Oct 9, 2026 17:442,53429,462,93620,779,000020,480
4Oct 9, 2026 17:442,53529,445,24920,793,000020,480
5Oct 9, 2026 17:442,54129,648,49020,841,000020,480
6Oct 9, 2026 17:442,54229,554,60320,846,000020,480
7Oct 9, 2026 17:442,54629,678,25620,885,000020,480
8Oct 9, 2026 17:442,54829,547,10319,880,0001,016,00020,480
9Oct 9, 2026 17:442,55029,664,46119,906,0001,010,00020,480