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 14:39Victor MerckléVictor MerckléScore: 2,833Success
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 14:392,76030,947,59021,614,0001,023,0002,117,632stderr
2Aug 23, 2026 14:392,76331,671,92621,646,0001,011,0002,117,632stderr
3Aug 23, 2026 14:392,76431,008,38921,659,0001,013,0002,117,632stderr
4Aug 23, 2026 14:392,77631,086,97221,633,0001,133,0002,117,632stderr
5Aug 23, 2026 14:392,83331,580,69022,054,0001,180,0002,117,632stderr
6Aug 23, 2026 14:392,83931,680,15522,134,0001,151,0002,117,632stderr
7Aug 23, 2026 14:395,38052,444,11343,005,0001,111,0002,117,632stderr
8Aug 23, 2026 14:395,41452,775,96843,274,0001,127,0002,117,632stderr
9Aug 23, 2026 14:395,45554,174,09143,572,0001,161,0002,117,632stderr