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 15, 2023 12:53Ulyanov AlekseyUlyanov AlekseyScore: 21,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 15, 2023 12:5321,552251,858,292176,726,58202,260,992
2Jun 15, 2023 12:5321,613248,287,107177,226,47802,265,088
3Jun 15, 2023 12:5321,613237,792,668177,228,91202,256,896