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 10:25Victor MerckléVictor MerckléScore: 2,742Success
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 10:282,72530,701,14421,268,0001,081,0002,117,632stderr
2Aug 29, 2026 10:282,73230,794,73321,308,0001,099,0002,117,632stderr
3Aug 29, 2026 10:282,73530,842,62521,356,0001,079,0002,117,632stderr
4Aug 29, 2026 10:282,73830,812,91421,387,0001,069,0002,117,632stderr
5Aug 29, 2026 10:282,74230,910,28721,379,0001,106,0002,117,632stderr
6Aug 29, 2026 10:282,75331,633,73321,562,0001,019,0002,117,632stderr
7Aug 29, 2026 10:282,75530,935,27221,580,0001,011,0002,117,632stderr
8Aug 29, 2026 10:285,36052,299,09242,922,0001,032,0002,117,632stderr
9Aug 29, 2026 10:285,36352,352,50242,956,0001,025,0002,117,632stderr