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:55mmalczakmmalczakScore: 1,000,153Success
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:55992,3208,199,563,5778,137,021,98902,170,880
2Nov 25, 2023 19:551,000,1538,256,624,7638,201,254,67702,187,264
3Nov 25, 2023 19:551,001,3588,268,322,7628,211,136,83202,187,264