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 listJun 19, 2021 13:28alex3dalex3dScore: 85,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2021 13:2883,884743,085,822687,848,39402,289,664
2Jun 19, 2021 13:2885,198758,410,436698,623,99802,301,952
3Jun 19, 2021 13:28104,981918,600,716860,843,29302,293,760