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 listAug 12, 2022 20:59Egor SergeevEgor SergeevScore: 87,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2022 20:5987,117771,973,169714,358,88102,301,952
2Aug 12, 2022 20:5987,159795,571,255714,706,06402,297,856
3Aug 12, 2022 20:5987,232786,440,880715,302,06002,289,664