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:08mmalczakmmalczakScore: 496,813Success
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:08490,4004,078,374,8314,021,279,76602,183,168
2Nov 25, 2023 20:08496,8134,125,876,2114,073,862,65702,183,168
3Nov 25, 2023 20:08502,4064,181,584,3784,119,727,05102,179,072