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 2, 2026 00:39Victor MerckléVictor MerckléScore: 11,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 00:402,99332,709,53723,511,0001,032,0002,117,632stderr
2Jul 2, 2026 00:403,06533,188,47423,990,0001,146,0002,117,632stderr
3Jul 2, 2026 00:4011,906105,910,23796,491,0001,142,0002,117,632stderr
4Jul 2, 2026 00:4011,911105,631,16696,539,0001,134,0002,117,632stderr
5Jul 2, 2026 00:4011,919105,712,08596,596,0001,142,0002,117,632stderr
6Jul 2, 2026 00:4011,962106,540,91796,963,0001,127,0002,117,632stderr
7Jul 2, 2026 00:4012,004106,343,14097,311,0001,126,0002,117,632stderr
8Jul 2, 2026 00:4012,005106,337,67397,301,0001,145,0002,117,632stderr
9Jul 2, 2026 00:4012,545110,804,429101,726,0001,145,0002,117,632stderr