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 03:17Paul MasurelPaul MasurelScore: 22,268Success
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 03:1722,212240,700,479182,135,99202,211,840
2Jul 13, 2023 03:1722,268249,956,030182,597,26902,265,088
3Jul 13, 2023 03:1722,393252,883,604183,624,73302,256,896