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 12, 2023 14:19Paul MasurelPaul MasurelScore: 20,485Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2023 14:1920,286238,153,122166,341,74402,281,472
2Jul 12, 2023 14:1920,485220,080,850167,973,61702,203,648
3Jul 12, 2023 14:1920,493236,296,813168,045,89002,215,936