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 listJul 13, 2023 09:05gchebanovgchebanovScore: 1,785,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2023 09:051,782,79214,691,300,00314,618,890,76202,318,336
2Jul 13, 2023 09:051,785,53414,711,773,81614,641,375,29702,314,240
3Jul 13, 2023 09:051,787,32514,716,268,33014,656,062,08502,314,240