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 listFeb 20, 2023 00:38LiamLiamScore: 39,045Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2023 00:3838,363393,138,853314,575,21102,301,952
2Feb 20, 2023 00:3839,045394,919,814320,168,77802,289,664
3Feb 20, 2023 00:3843,533425,009,207356,971,15502,301,952