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 listOct 14, 2024 00:16zielajzielajScore: 6,641Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:166,45876,712,06338,965,00013,987,0002,523,136
2Oct 14, 2024 00:166,64177,801,62039,330,00015,126,0002,383,872
3Oct 14, 2024 00:166,67675,905,51538,821,00015,926,0002,412,544