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 listSep 1, 2026 14:08Victor MerckléVictor MerckléScore: 2,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 1, 2026 14:092,62629,939,96720,502,0001,032,0002,117,632stderr
2Sep 1, 2026 14:092,63029,881,38920,557,0001,014,0002,117,632stderr
3Sep 1, 2026 14:092,63530,025,29720,592,0001,022,0002,117,632stderr
4Sep 1, 2026 14:092,63729,970,68520,614,0001,013,0002,117,632stderr
5Sep 1, 2026 14:092,64029,853,52620,636,0001,019,0002,117,632stderr
6Sep 1, 2026 14:092,64929,785,51620,551,0001,176,0002,117,632stderr
7Sep 1, 2026 14:095,25951,467,94741,929,0001,201,0002,117,632stderr
8Sep 1, 2026 14:095,29951,816,88642,187,0001,269,0002,117,632stderr
9Sep 1, 2026 14:095,84656,310,20745,757,0002,182,0002,117,632stderr