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 20, 2021 14:10Andrey TsvetkovAndrey TsvetkovScore: 100,988Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2021 14:1097,130861,676,763796,467,68502,260,992
2Jun 20, 2021 14:10100,988894,467,617828,100,65702,269,184
3Jun 20, 2021 14:10119,7571,057,014,015982,008,47502,265,088