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 10, 2026 09:00Pavel SkripkinPavel SkripkinScore: 4,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 09:014,46650,855,86732,270,0004,356,0002,510,848
2May 10, 2026 09:014,49854,291,36132,273,0004,612,0002,338,816
3May 10, 2026 09:014,51555,092,36532,321,0004,705,0002,539,520
4May 10, 2026 09:014,54851,721,45332,707,0004,587,0002,449,408
5May 10, 2026 09:014,63155,208,03033,763,0004,217,0002,453,504
6May 10, 2026 09:0124,276216,534,994194,851,0004,213,0002,420,736
7May 10, 2026 09:0124,539217,319,751196,571,0004,656,0002,433,024
8May 10, 2026 09:0124,981219,622,128200,087,0004,758,0002,564,096
9May 10, 2026 09:0126,635233,388,665213,926,0004,489,0002,318,336