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:07mmalczakmmalczakScore: 497,531Success
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:07496,2094,124,262,3864,068,909,91602,179,072
2Nov 25, 2023 20:07497,5314,138,600,9804,079,752,79702,179,072
3Nov 25, 2023 20:07519,9754,318,947,2014,263,791,21602,187,264