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 listJul 7, 2026 01:46Victor MerckléVictor MerckléScore: 11,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:472,87832,009,93722,544,0001,060,0002,117,632stderr
2Jul 7, 2026 01:472,93231,962,00723,005,0001,044,0002,117,632stderr
3Jul 7, 2026 01:473,06333,124,34723,982,0001,141,0002,117,632stderr
4Jul 7, 2026 01:4711,712104,041,14894,899,0001,141,0002,117,632stderr
5Jul 7, 2026 01:4711,801104,778,85295,603,0001,166,0002,117,632stderr
6Jul 7, 2026 01:4711,866105,281,37996,140,0001,169,0002,117,632stderr
7Jul 7, 2026 01:4711,947106,025,32696,727,0001,240,0002,117,632stderr
8Jul 7, 2026 01:4712,184107,854,69498,900,0001,013,0002,117,632stderr
9Jul 7, 2026 01:4712,460110,637,957100,923,0001,253,0002,117,632stderr