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 listSep 25, 2026 21:20Kevin HeaveyKevin HeaveyScore: 2,513Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 21:232,50529,098,43420,544,000020,480
2Sep 25, 2026 21:232,50529,193,29920,547,000020,480
3Sep 25, 2026 21:232,51129,224,06420,594,000020,480
4Sep 25, 2026 21:232,51229,962,37220,605,000020,480
5Sep 25, 2026 21:232,51329,313,31220,614,000020,480
6Sep 25, 2026 21:232,51429,231,19020,622,000020,480
7Sep 25, 2026 21:236,09658,653,99447,967,0002,025,00020,480
8Sep 25, 2026 21:236,20060,252,59248,803,0002,039,00020,480
9Sep 25, 2026 21:236,21359,975,01248,921,0002,033,00020,480