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 13, 2024 07:23Andrey LikhachevAndrey LikhachevScore: 43,228Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2024 07:2339,458391,275,211323,558,44902,236,416
2Jun 13, 2024 07:2343,228415,058,749354,469,88102,228,224
3Jun 13, 2024 07:2346,011454,418,253377,287,13402,232,320