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 05:18Victor MerckléVictor MerckléScore: 3,179Success
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 05:193,11233,713,51824,507,0001,014,0002,117,632stderr
2Jul 4, 2026 05:193,15533,832,16124,755,0001,119,0002,117,632stderr
3Jul 4, 2026 05:193,17133,934,33024,875,0001,128,0002,117,632stderr
4Jul 4, 2026 05:193,17734,059,93325,023,0001,033,0002,117,632stderr
5Jul 4, 2026 05:193,17933,934,61525,046,0001,022,0002,117,632stderr
6Jul 4, 2026 05:1911,877105,320,28296,349,0001,044,0002,117,632stderr
7Jul 4, 2026 05:1911,951106,281,59496,842,0001,157,0002,117,632stderr
8Jul 4, 2026 05:1911,998106,312,15697,345,0001,046,0002,117,632stderr
9Jul 4, 2026 05:1912,024106,558,87397,444,0001,153,0002,117,632stderr