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:28Karthik 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 01:280404,708,532390,980,0004,552,00020,480expected "2035011313 ", got ".12al .15ai .15ai .15ah .30aq .26am .26ap .16ah "
2Oct 3, 2026 01:2845,896385,470,396376,355,000020,480
3Oct 3, 2026 01:2846,423389,752,422379,482,0001,192,00020,480