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 21, 2024 23:09Andrey LikhachevAndrey LikhachevScore: 51,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2024 23:0947,714457,567,675391,256,41802,301,952
2Jun 21, 2024 23:0951,669490,909,526423,684,20502,240,512
3Jun 21, 2024 23:0952,931500,241,470434,032,08102,371,584