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 21, 2024 14:14GabriellaGabriellaScore: 167,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 21, 2024 14:14166,8421,428,159,5821,368,107,56002,289,664
2Aug 21, 2024 14:14167,8531,435,282,9161,376,393,96302,289,664
3Aug 21, 2024 14:14169,2101,445,983,8031,387,523,58602,293,760