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 15:06Victor MerckléVictor MerckléScore: 5,423Success
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 15:092,78631,158,28421,825,0001,023,0002,117,632stderr
2Aug 23, 2026 15:092,79131,039,25621,741,0001,149,0002,117,632stderr
3Aug 23, 2026 15:092,81031,990,39321,882,0001,162,0002,117,632stderr
4Aug 23, 2026 15:092,81231,315,06121,907,0001,158,0002,117,632stderr
5Aug 23, 2026 15:095,42352,927,63043,412,0001,063,0002,117,632stderr
6Aug 23, 2026 15:095,48253,201,74343,880,0001,080,0002,117,632stderr
7Aug 23, 2026 15:095,49454,044,32143,921,0001,137,0002,117,632stderr
8Aug 23, 2026 15:095,51953,601,50044,121,0001,141,0002,117,632stderr
9Aug 23, 2026 15:095,62755,127,47744,982,0001,163,0002,117,632stderr