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:38Ulyanov AlekseyUlyanov AlekseyScore: 16,086Success
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:3816,053194,190,623131,633,92002,260,992
2Jun 17, 2023 23:3816,086210,287,859131,906,48002,265,088
3Jun 17, 2023 23:3816,109224,759,138132,094,94702,260,992