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 14, 2026 18:33marko1597marko1597Score: 3,842Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 18:383,76639,331,98829,839,0001,049,0002,121,728stderr
2Aug 14, 2026 18:383,79939,610,46830,122,0001,030,0002,121,728stderr
3Aug 14, 2026 18:383,81440,800,29630,240,0001,041,0002,121,728stderr
4Aug 14, 2026 18:383,82439,831,74630,322,0001,039,0002,121,728stderr
5Aug 14, 2026 18:383,84239,956,31730,484,0001,025,0002,121,728stderr
6Aug 14, 2026 18:383,84939,942,73830,549,0001,019,0002,121,728stderr
7Aug 14, 2026 18:383,87540,292,89730,764,0001,018,0002,121,728stderr
8Aug 14, 2026 18:383,88640,339,83530,842,0001,026,0002,121,728stderr
9Aug 14, 2026 18:384,62646,336,92636,899,0001,035,0002,121,728stderr