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 13, 2024 15:38zielajzielajScore: 17,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 15:3817,066163,587,646123,945,00015,993,0002,424,832
2Oct 13, 2024 15:3817,353164,008,259127,266,00015,031,0002,342,912
3Oct 13, 2024 15:3817,642175,641,583125,706,00018,955,0002,359,296