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 23, 2024 21:42Andrey LikhachevAndrey LikhachevScore: 4,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2024 21:424,609109,307,87237,796,13102,269,184
2Jun 23, 2024 21:424,647106,677,76538,104,84002,265,088
3Jun 23, 2024 21:424,658101,365,29538,192,96902,367,488