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 16, 2023 12:07Ulyanov AlekseyUlyanov AlekseyScore: 147,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2023 12:07147,4331,268,454,7331,208,954,40302,260,992
2Jun 16, 2023 12:07147,8911,274,690,9721,212,704,73202,269,184
3Jun 16, 2023 12:07148,5721,283,625,4661,218,287,15202,269,184