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:35Victor MerckléVictor MerckléScore: 3,011Success
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:362,87231,642,52722,529,0001,024,0002,117,632stderr
2Jul 14, 2026 19:362,87531,696,07322,463,0001,117,0002,117,632stderr
3Jul 14, 2026 19:362,88231,687,49722,609,0001,030,0002,117,632stderr
4Jul 14, 2026 19:362,95032,183,07023,164,0001,033,0002,117,632stderr
5Jul 14, 2026 19:363,01132,712,71423,674,0001,023,0002,117,632stderr
6Jul 14, 2026 19:3611,693103,874,68394,647,0001,236,0002,117,632stderr
7Jul 14, 2026 19:3611,736104,230,74795,195,0001,048,0002,117,632stderr
8Jul 14, 2026 19:3611,759104,361,32895,302,0001,122,0002,117,632stderr
9Jul 14, 2026 19:3612,287108,773,05499,604,0001,155,0002,117,632stderr