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 00:13Karthik ReddyKarthik ReddyError
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 00:1306,035,219,24019,503,0006,472,00024,576expected "2039508085 ", got "0 "stderr
2Oct 3, 2026 00:1306,034,962,53619,405,0006,291,00024,576expected "2079187059 ", got "0 "stderr
3Oct 3, 2026 00:1306,034,039,64419,457,0005,346,00024,576expected "2288658590 ", got "0 "stderr