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 14, 2026 19:30Victor MerckléVictor MerckléScore: 3,204Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 19:313,02833,316,87023,687,0001,143,0002,117,632stderr
2Jul 14, 2026 19:313,04632,976,79323,952,0001,028,0002,117,632stderr
3Jul 14, 2026 19:313,08533,322,58924,243,0001,061,0002,117,632stderr
4Jul 14, 2026 19:313,12233,647,62724,476,0001,127,0002,117,632stderr
5Jul 14, 2026 19:313,20434,307,74125,100,0001,176,0002,117,632stderr
6Jul 14, 2026 19:3111,979106,276,52797,169,0001,064,0002,117,632stderr
7Jul 14, 2026 19:3112,008106,440,07097,348,0001,118,0002,117,632stderr
8Jul 14, 2026 19:3112,049106,913,77397,768,0001,036,0002,117,632stderr
9Jul 14, 2026 19:3112,284108,738,42999,580,0001,152,0002,117,632stderr