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 9, 2026 14:29Karthik ReddyKarthik ReddyScore: 2,549Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 14:522,53730,327,70520,804,000020,480
2Oct 9, 2026 14:522,54029,761,34920,830,000020,480
3Oct 9, 2026 14:522,54629,742,11920,883,000020,480
4Oct 9, 2026 14:522,54929,747,48520,903,000020,480
5Oct 9, 2026 14:522,54930,410,91920,905,000020,480
6Oct 9, 2026 14:522,55829,952,34219,886,0001,097,00020,480
7Oct 9, 2026 14:522,56230,592,40319,983,0001,027,00020,480
8Oct 9, 2026 14:522,56830,089,44121,060,000020,480
9Oct 9, 2026 14:522,58830,920,67320,194,0001,035,00020,480