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 20:06mmalczakmmalczakScore: 519,164Success
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 20:06517,1604,293,742,5724,240,710,59202,179,072
2Nov 25, 2023 20:06519,1644,313,159,8224,257,147,05602,183,168
3Nov 25, 2023 20:06523,0704,354,621,4754,289,174,70002,174,976