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 2, 2024 19:59Andrey LikhachevAndrey LikhachevScore: 3,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2024 19:593,42395,669,08528,067,67902,260,992
2Aug 2, 2024 19:593,45295,080,33628,303,85702,281,472
3Aug 2, 2024 19:593,47699,618,92828,500,62302,220,032