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:15Karthik ReddyKarthik ReddyScore: 2,705Success
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:162,48129,350,69120,349,000020,480
2Oct 3, 2026 01:162,48730,842,22120,394,000020,480
3Oct 3, 2026 01:162,65330,779,46420,218,0001,542,00020,480
4Oct 3, 2026 01:162,69931,189,49620,293,0001,845,00020,480
5Oct 3, 2026 01:162,70531,121,16020,358,0001,826,00020,480
6Oct 3, 2026 01:162,81132,062,67819,557,0003,496,00020,480
7Oct 3, 2026 01:162,82032,177,89019,576,0003,553,00020,480
8Oct 3, 2026 01:162,84532,374,01319,538,0003,799,00020,480
9Oct 3, 2026 01:164,83348,697,93738,485,0001,147,00020,480