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:17mmalczakmmalczakScore: 211,049Success
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:17207,6231,756,179,2221,702,507,34902,170,880
2Nov 25, 2023 20:17211,0491,791,298,2951,730,604,32402,174,976
3Nov 25, 2023 20:17223,0291,893,475,9261,828,836,17602,174,976