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 listAug 20, 2024 22:42Jatin YadavJatin YadavScore: 59,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2024 22:4259,161541,410,096485,117,74202,273,280
2Aug 20, 2024 22:4259,211550,936,235485,529,42602,269,184
3Aug 20, 2024 22:4259,879552,776,288491,011,07602,273,280