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 17, 2023 23:33Ulyanov AlekseyUlyanov AlekseyScore: 17,690Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2023 23:3317,662210,573,392144,831,69502,236,416
2Jun 17, 2023 23:3317,690200,234,006145,057,48202,252,800
3Jun 17, 2023 23:3317,900209,155,931146,779,66202,244,608