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 listSep 28, 2023 14:47apuxbtapuxbtScore: 49,058Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2023 14:4748,353465,964,614396,490,77102,310,144
2Sep 28, 2023 14:4749,058463,611,266402,278,09902,273,280
3Sep 28, 2023 14:4752,008499,071,959426,467,09602,256,896