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 listMay 22, 2023 08:57Franek KortaFranek KortaScore: 18,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2023 08:5715,831185,515,422129,812,06602,281,472
2May 22, 2023 08:5718,141205,326,123148,754,74102,215,936
3May 22, 2023 08:5719,225222,586,086157,645,42202,191,360