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:21Karthik 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:210395,583,768383,509,0002,883,00020,480expected "2042062646 ", got ".11aq .14af .12ak .07ak .17ad .14as .14at .14aq "
2Oct 3, 2026 01:210394,083,563383,975,0001,034,00020,480expected "2082230321 ", got ".20as .18ab .30ap .26af .23ac .22ah .18ae .21ac "
3Oct 3, 2026 01:210390,263,237379,566,0001,654,00020,480expected "2216436320 ", got ".17ap .15ab .15ab .15ab .15ab .19al .15ab .20ai "