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 28, 2024 16:38Drew GarciaDrew GarciaScore: 101,829Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2024 16:3895,583838,116,715783,778,08102,277,376
2Mar 28, 2024 16:38101,829893,776,351835,000,10802,273,280
3Mar 28, 2024 16:38107,710950,020,586883,219,47102,281,472