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 listAug 29, 2026 13:24Victor MerckléVictor MerckléScore: 5,397Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 13:242,74030,569,17021,293,0001,175,0002,117,632stderr
2Aug 29, 2026 13:242,74330,656,42021,485,0001,011,0002,117,632stderr
3Aug 29, 2026 13:242,76130,827,42921,627,0001,014,0002,117,632stderr
4Aug 29, 2026 13:245,38452,475,85843,103,0001,049,0002,117,632stderr
5Aug 29, 2026 13:245,39752,804,47043,217,0001,044,0002,117,632stderr
6Aug 29, 2026 13:245,43652,964,56243,456,0001,125,0002,117,632stderr
7Aug 29, 2026 13:245,44452,896,76243,542,0001,106,0002,117,632stderr
8Aug 29, 2026 13:2414,203124,622,796115,304,0001,164,0002,117,632stderr
9Aug 29, 2026 13:2414,489127,191,365117,611,0001,199,0002,117,632stderr