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 23, 2026 19:09Victor MerckléVictor MerckléScore: 5,663Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:103,00932,957,53923,658,0001,016,0002,117,632stderr
2Aug 23, 2026 19:105,59654,248,18644,851,0001,041,0002,117,632stderr
3Aug 23, 2026 19:105,63954,605,79345,116,0001,125,0002,117,632stderr
4Aug 23, 2026 19:105,66154,824,94345,341,0001,086,0002,117,632stderr
5Aug 23, 2026 19:105,66355,397,51145,295,0001,146,0002,117,632stderr
6Aug 23, 2026 19:105,69455,046,30445,680,0001,014,0002,117,632stderr
7Aug 23, 2026 19:105,70755,112,84245,669,0001,129,0002,117,632stderr
8Aug 23, 2026 19:105,71255,193,87445,716,0001,126,0002,117,632stderr
9Aug 23, 2026 19:105,71755,301,05845,766,0001,120,0002,117,632stderr