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:00mmalczakmmalczakScore: 536,769Success
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:02512,6344,264,923,6534,203,601,28202,183,168
2Nov 25, 2023 20:02529,6704,406,252,0874,343,295,17502,183,168
3Nov 25, 2023 20:00534,8534,438,169,6514,385,798,21902,183,168
4Nov 25, 2023 20:00536,7694,459,651,8494,401,509,01302,174,976
5Nov 25, 2023 20:00538,6504,474,174,6594,416,926,27602,183,168
6Nov 25, 2023 20:02542,4734,502,733,9734,448,275,43302,174,976