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 23, 2026 19:04Victor MerckléVictor MerckléScore: 5,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:052,72530,661,91121,257,0001,094,0002,117,632stderr
2Aug 23, 2026 19:052,90432,158,02122,613,0001,202,0002,117,632stderr
3Aug 23, 2026 19:055,36252,307,77142,942,0001,032,0002,117,632stderr
4Aug 23, 2026 19:055,36252,340,09142,914,0001,057,0002,117,632stderr
5Aug 23, 2026 19:055,37752,450,79743,042,0001,054,0002,117,632stderr
6Aug 23, 2026 19:055,41952,776,02943,192,0001,244,0002,117,632stderr
7Aug 23, 2026 19:055,42152,810,61943,307,0001,151,0002,117,632stderr
8Aug 23, 2026 19:055,54453,904,97444,442,0001,019,0002,117,632stderr
9Aug 23, 2026 19:055,62054,429,60145,068,0001,018,0002,117,632stderr