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, 2022 20:31Robert BurkeRobert BurkeScore: 6,426Success
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, 2022 20:316,211119,172,37850,934,20702,297,856
2Aug 2, 2022 20:316,426116,725,73652,696,47902,191,360
3Aug 2, 2022 20:316,768134,535,99655,499,59702,199,552