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 7, 2026 01:57Victor MerckléVictor MerckléScore: 3,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:583,08733,325,51324,245,0001,074,0002,117,632stderr
2Jul 7, 2026 01:583,09133,347,90924,307,0001,041,0002,117,632stderr
3Jul 7, 2026 01:583,11333,727,64924,387,0001,145,0002,117,632stderr
4Jul 7, 2026 01:583,11733,650,89424,541,0001,022,0002,117,632stderr
5Jul 7, 2026 01:583,12233,668,93324,484,0001,118,0002,117,632stderr
6Jul 7, 2026 01:583,12533,596,99424,527,0001,099,0002,117,632stderr
7Jul 7, 2026 01:583,12733,654,54424,613,0001,033,0002,117,632stderr
8Jul 7, 2026 01:5812,732113,466,967103,378,0001,032,0002,117,632stderr
9Jul 7, 2026 01:5812,748112,635,826103,370,0001,168,0002,117,632stderr