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 26, 2023 08:35mmalczakmmalczakScore: 81,358Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2023 08:3579,912718,600,831655,274,36002,174,976
2Nov 26, 2023 08:2180,225721,963,676657,845,61002,183,168
3Nov 26, 2023 08:2180,243723,885,310657,991,96302,174,976
4Nov 26, 2023 08:3581,358735,573,557667,136,32002,187,264
5Nov 26, 2023 08:3583,169758,516,408681,984,93702,174,976
6Nov 26, 2023 08:2187,125768,803,061714,426,36302,179,072