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 8, 2024 22:10Michael AnoprenkoMichael AnoprenkoScore: 95,016Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2024 22:1090,594805,256,089742,868,36702,285,568
2Aug 8, 2024 22:1095,016851,496,112779,134,03302,289,664
3Aug 8, 2024 22:1098,842875,553,738810,504,87802,297,856