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 21:31alex3dalex3dScore: 128,156Success
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 21:31114,8181,014,908,505941,509,09702,301,952
2Jun 19, 2021 21:31128,1561,109,757,1111,050,883,08702,301,952
3Jun 19, 2021 21:31129,3451,133,678,6181,060,630,07702,310,144