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 14, 2021 20:01Mikhail ShirokovMikhail ShirokovScore: 120,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 14, 2021 20:01119,0611,036,066,706976,300,79702,224,128
2Jun 14, 2021 20:01120,5841,046,170,119988,791,51502,318,336
3Jun 14, 2021 20:01121,6431,064,677,371997,472,58702,199,552