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 4, 2026 06:11Victor MerckléVictor MerckléScore: 3,022Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 06:122,87931,375,66322,402,0001,212,0002,117,632stderr
2Jul 4, 2026 06:122,92031,772,09822,881,0001,064,0002,117,632stderr
3Jul 4, 2026 06:122,95832,102,34323,176,0001,080,0002,117,632stderr
4Jul 4, 2026 06:122,99032,245,92423,479,0001,042,0002,117,632stderr
5Jul 4, 2026 06:123,02232,871,71223,543,0001,239,0002,117,632stderr
6Jul 4, 2026 06:123,47936,783,87727,477,0001,052,0002,117,632stderr
7Jul 4, 2026 06:123,49336,406,05727,610,0001,033,0002,117,632stderr
8Jul 4, 2026 06:123,53537,208,42127,937,0001,057,0002,117,632stderr
9Jul 4, 2026 06:1211,735103,961,04995,217,0001,011,0002,117,632stderr