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 22, 2024 22:53Andrey LikhachevAndrey LikhachevScore: 43,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2024 22:5340,421394,550,936331,451,55702,228,224
2Jun 22, 2024 22:5343,191414,428,500354,162,97702,224,128
3Jun 22, 2024 22:5345,243426,726,939370,990,48102,228,224