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 17:25gchebanovgchebanovScore: 30,248Success
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 17:2529,580302,169,492242,553,15102,224,128
2Jun 27, 2021 17:2530,248309,519,667248,029,64802,232,320
3Jun 27, 2021 17:2531,107317,691,069255,077,31302,232,320