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 listMar 29, 2024 15:35Drew GarciaDrew GarciaScore: 92,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2024 15:3264,587611,437,520529,612,68002,244,608
2Mar 29, 2024 15:3565,628594,768,137538,151,29802,285,568
3Mar 29, 2024 15:3272,522654,192,205594,679,29802,277,376
4Mar 29, 2024 15:3292,020819,234,060754,564,43902,285,568
5Mar 29, 2024 15:3599,794884,067,579818,308,34902,269,184
6Mar 29, 2024 15:35131,0211,133,911,8311,074,376,16902,281,472