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 listNov 25, 2023 19:47mmalczakmmalczakScore: 990,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 25, 2023 19:47983,9978,142,719,3178,068,771,87002,183,168
2Nov 25, 2023 19:47990,0878,181,551,6668,118,712,29202,183,168
3Nov 25, 2023 19:47997,1518,236,177,7998,176,635,33302,187,264