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:55apuxbtapuxbtScore: 46,662Success
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:5545,727451,026,539374,961,07502,179,072
2Sep 28, 2023 14:5546,662440,487,243382,630,81502,285,568
3Sep 28, 2023 14:5546,806454,818,867383,812,90402,232,320