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 29, 2021 19:59alex3dalex3dScore: 194,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2021 19:59165,9051,438,103,3801,360,419,68402,289,664
2Jun 29, 2021 19:59194,6371,662,550,3401,596,022,87602,289,664
3Jun 29, 2021 19:59195,8691,655,826,2651,606,127,28502,297,856