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:42Karthik 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:420248,826,125238,211,0001,583,00020,480expected "2307319661 ", got "Z0 8 179 2 0 -55 -102 -179 -78 42 "
2Oct 3, 2026 00:420260,201,584249,555,0001,696,00020,480expected "2336011198 ", got "Z0 8 154 6 0 7 -11 31 45 66 "
3Oct 3, 2026 00:420252,213,585238,831,0004,450,00020,480expected "2197599825 ", got "Z0 8 121 6 0 -15 5 -44 -47 55 "