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 listAug 29, 2026 13:45Victor MerckléVictor MerckléScore: 2,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:462,73830,790,13421,335,0001,119,0002,117,632stderr
2Aug 29, 2026 13:462,74431,475,99621,490,0001,018,0002,117,632stderr
3Aug 29, 2026 13:462,75630,901,40421,588,0001,014,0002,117,632stderr
4Aug 29, 2026 13:462,75630,968,21021,591,0001,011,0002,117,632stderr
5Aug 29, 2026 13:462,80738,357,91222,003,0001,015,0002,117,632stderr
6Aug 29, 2026 13:465,35852,042,12442,873,0001,063,0002,117,632stderr
7Aug 29, 2026 13:465,38652,285,36643,134,0001,037,0002,117,632stderr
8Aug 29, 2026 13:465,48260,384,07943,778,0001,181,0002,117,632stderr
9Aug 29, 2026 13:465,61754,144,80445,047,0001,018,0002,117,632stderr