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 listApr 21, 2026 22:08BenBenScore: 12,812Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 22:0912,767124,555,890102,697,0001,994,0002,547,712
2Apr 21, 2026 22:0912,780122,020,574101,804,0002,994,0002,416,640
3Apr 21, 2026 22:0912,785127,660,528101,846,0002,995,0002,428,928
4Apr 21, 2026 22:0912,794126,951,141101,919,0002,997,0002,412,544
5Apr 21, 2026 22:0912,812122,611,417102,065,0003,001,0002,490,368
6Apr 21, 2026 22:0912,829121,663,342102,196,0003,005,0002,412,544
7Apr 21, 2026 22:0912,833122,222,784102,227,0003,006,0002,396,160
8Apr 21, 2026 22:0912,845117,795,915103,323,0002,006,0002,547,712
9Apr 21, 2026 22:0912,867129,644,215102,528,0002,986,0002,502,656