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 listAug 16, 2026 12:33marko1597marko1597Score: 6,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 12:412,71630,690,17421,162,0001,113,0002,117,632stderr
2Aug 16, 2026 12:412,73730,851,89021,312,0001,132,0002,117,632stderr
3Aug 16, 2026 12:412,74830,913,80621,519,0001,016,0002,117,632stderr
4Aug 16, 2026 12:412,75530,852,86821,435,0001,156,0002,117,632stderr
5Aug 16, 2026 12:416,97365,626,19055,997,0001,182,0002,117,632stderr
6Aug 16, 2026 12:417,04365,894,29056,723,0001,033,0002,117,632stderr
7Aug 16, 2026 12:417,04366,215,04656,593,0001,162,0002,117,632stderr
8Aug 16, 2026 12:417,08566,340,17356,924,0001,176,0002,117,632stderr
9Aug 16, 2026 12:417,21467,355,56958,137,0001,021,0002,117,632stderr