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:03Karthik ReddyKarthik ReddyScore: 2,678Success
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:042,50629,668,62119,554,0001,003,00020,480
2Oct 3, 2026 01:042,55329,953,27719,915,0001,021,00020,480
3Oct 3, 2026 01:042,65330,766,51119,597,0002,160,00020,480
4Oct 3, 2026 01:042,66330,818,42620,223,0001,614,00020,480
5Oct 3, 2026 01:042,67831,057,99319,578,0002,382,00020,480
6Oct 3, 2026 01:042,68931,117,11720,284,0001,769,00020,480
7Oct 3, 2026 01:042,72931,403,75420,324,0002,059,00020,480
8Oct 3, 2026 01:042,75031,641,61120,363,0002,187,00020,480
9Oct 3, 2026 01:042,77531,841,71720,451,0002,312,00020,480