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 listOct 14, 2024 00:37zielajzielajScore: 5,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:375,80272,618,73134,417,00013,159,0002,285,568
2Oct 14, 2024 00:375,99968,988,08139,150,00010,038,0002,289,664
3Oct 14, 2024 00:376,17375,585,77239,482,00011,136,0002,510,848