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 listJan 15, 2025 23:53Ian MckibbenIan MckibbenScore: 12,219Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2025 23:5312,185121,741,77997,923,0001,998,0002,457,600
2Jan 15, 2025 23:5312,201128,010,36398,049,0002,001,0002,420,736
3Jan 15, 2025 23:5312,211126,910,37898,129,0002,002,0002,457,600
4Jan 15, 2025 23:5312,213122,670,248100,145,00002,420,736
5Jan 15, 2025 23:5312,219123,874,07298,192,0002,003,0002,408,448
6Jan 15, 2025 23:5312,222128,841,90598,217,0002,004,0002,449,408
7Jan 15, 2025 23:5312,242127,414,33899,379,0001,003,0002,461,696
8Jan 15, 2025 23:5312,283128,364,94098,727,0001,994,0002,412,544
9Jan 15, 2025 23:5312,291128,215,18298,788,0001,995,0002,412,544