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 16:28Victor MerckléVictor MerckléScore: 3,370Success
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 16:293,27235,050,49525,827,0001,010,0002,117,632stderr
2Aug 23, 2026 16:293,27635,141,69925,853,0001,017,0002,117,632stderr
3Aug 23, 2026 16:293,30435,298,84826,090,0001,010,0002,117,632stderr
4Aug 23, 2026 16:293,33636,389,75826,332,0001,031,0002,117,632stderr
5Aug 23, 2026 16:293,37036,635,36826,547,0001,092,0002,117,632stderr
6Aug 23, 2026 16:293,38636,781,49326,628,0001,143,0002,117,632stderr
7Aug 23, 2026 16:295,93156,775,59447,544,0001,096,0002,117,632stderr
8Aug 23, 2026 16:295,94557,590,84847,612,0001,141,0002,117,632stderr
9Aug 23, 2026 16:295,97357,160,72647,854,0001,130,0002,117,632stderr