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 listJun 12, 2026 10:58Victor MerckléVictor MerckléScore: 3,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 10:583,32334,656,80326,189,0001,064,0002,113,536
2Jun 12, 2026 10:583,35135,050,90126,454,0001,028,0002,113,536
3Jun 12, 2026 10:583,35534,944,63626,470,0001,041,0002,113,536
4Jun 12, 2026 10:583,36935,084,50126,594,0001,032,0002,113,536
5Jun 12, 2026 10:583,38535,153,74726,727,0001,031,0002,113,536
6Jun 12, 2026 10:583,38635,319,31826,742,0001,031,0002,113,536
7Jun 12, 2026 10:583,39035,184,71826,731,0001,070,0002,113,536
8Jun 12, 2026 10:583,44035,847,39527,150,0001,062,0002,113,536
9Jun 12, 2026 10:5812,840112,836,985103,059,0002,231,0002,113,536