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:27Karthik 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:270409,470,018399,231,0001,172,00020,480expected "2059513411 ", got ".19at .15aq .21ar P27th .13af .13ak .18aj .22ah "
2Oct 3, 2026 01:270419,268,572407,224,0003,062,00020,480expected "2174469263 ", got ".14ak .19as .14aj .14at .16aq .09ap .17af .21ap "
3Oct 3, 2026 01:270397,563,213386,552,0001,807,00020,480expected "2056804944 ", got ".08af .13ai .13at .20an .13as .17ac .12ag .14ae "