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 14:41mmalczakmmalczakScore: 987,905Success
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 14:41987,8608,153,932,4748,100,455,57402,191,360
2Nov 25, 2023 14:41987,9058,165,614,2288,100,823,01602,179,072
3Nov 25, 2023 14:41990,6638,179,824,5868,123,439,24202,179,072