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 19, 2026 17:24Victor MerckléVictor MerckléScore: 5,543Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 19, 2026 17:312,81131,188,31321,858,0001,200,0002,117,632stderr
2Aug 19, 2026 17:312,84931,608,42022,340,0001,024,0002,117,632stderr
3Aug 19, 2026 17:312,86331,672,34322,456,0001,025,0002,117,632stderr
4Aug 19, 2026 17:315,51653,483,40744,209,0001,023,0002,117,632stderr
5Aug 19, 2026 17:315,54353,702,21844,416,0001,039,0002,117,632stderr
6Aug 19, 2026 17:315,54653,702,38344,443,0001,035,0002,117,632stderr
7Aug 19, 2026 17:315,55354,527,25644,511,0001,025,0002,117,632stderr
8Aug 19, 2026 17:315,56855,287,05944,636,0001,024,0002,117,632stderr
9Aug 19, 2026 17:315,56853,784,36444,645,0001,017,0002,117,632stderr