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 23:47zielajzielajScore: 5,190Success
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 23:475,07969,612,72630,472,00011,173,0002,322,432
2Oct 14, 2024 23:475,19063,473,81829,383,00013,171,0002,416,640
3Oct 14, 2024 23:475,34670,593,88730,883,00012,951,0002,355,200