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:20Karthik 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:210386,153,908375,832,0001,283,00020,480expected "2096199871 ", got ".13aq .16ao .22as .20ac .14ai .15ae .13at .19ah "
2Oct 3, 2026 01:210396,104,825384,310,0002,792,00020,480expected "2195113816 ", got ".19at .16ak .18ak .17ah .21as .11at .10ae .24at "
3Oct 3, 2026 01:210392,024,076381,422,0001,541,00020,480expected "2120767784 ", got ".17ad .16as .12ab .18ah .19ad .19ar .22aj .37as "