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 30, 2023 18:34apuxbtapuxbtScore: 85,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2023 18:3485,006789,630,186697,047,53802,236,416
2Sep 30, 2023 18:3485,702775,413,345702,757,42002,232,320
3Sep 30, 2023 18:3486,063764,010,388705,718,28202,236,416