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:18Karthik 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:180412,214,695400,218,0002,723,00020,480expected "2137067535 ", got ".20ak .13ag P30tr .14ag .15at .16at .09ac .18at "
2Oct 3, 2026 01:180393,412,007384,360,000020,480expected "2191595341 ", got ".21as .10ai .18as .13ae .20af .25ap .21at .20ag "
3Oct 3, 2026 01:180393,210,228380,610,0003,453,00020,480expected "2118079657 ", got ".13ac .14af .17aj .13af .16ad .12ab .18ac .12ab "