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 18, 2026 15:28Victor MerckléVictor MerckléScore: 5,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 15:293,02333,112,67623,671,0001,125,0002,117,632stderr
2Aug 18, 2026 15:293,13134,055,54724,660,0001,017,0002,117,632stderr
3Aug 18, 2026 15:293,26234,872,05825,579,0001,172,0002,117,632stderr
4Aug 18, 2026 15:295,83356,104,72846,800,0001,038,0002,117,632stderr
5Aug 18, 2026 15:295,87956,407,59347,167,0001,041,0002,117,632stderr
6Aug 18, 2026 15:295,89956,663,68747,345,0001,028,0002,117,632stderr
7Aug 18, 2026 15:295,92756,851,02347,578,0001,031,0002,117,632stderr
8Aug 18, 2026 15:295,94657,311,00547,716,0001,047,0002,117,632stderr
9Aug 18, 2026 15:296,01257,497,50348,148,0001,158,0002,117,632stderr