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 27, 2021 18:23gchebanovgchebanovScore: 33,528Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2021 18:2331,379317,416,471257,308,35502,228,224
2Jun 27, 2021 18:2333,528327,962,718274,928,58002,240,512
3Jun 27, 2021 18:2337,114359,606,748304,331,24802,240,512