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 listJun 23, 2026 23:21Victor MerckléVictor MerckléScore: 3,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 23:223,06132,847,37123,890,0001,213,0002,113,536
2Jun 23, 2026 23:223,08132,884,82024,186,0001,082,0002,113,536
3Jun 23, 2026 23:223,08732,899,23724,122,0001,198,0002,113,536
4Jun 23, 2026 23:223,10033,071,35824,194,0001,229,0002,113,536
5Jun 23, 2026 23:223,10033,171,11624,230,0001,195,0002,113,536
6Jun 23, 2026 23:223,12633,273,27324,544,0001,093,0002,113,536
7Jun 23, 2026 23:225,95356,483,07447,797,0001,019,0002,113,536
8Jun 23, 2026 23:225,95456,832,18247,804,0001,020,0002,113,536
9Jun 23, 2026 23:226,08157,590,75048,853,0001,016,0002,113,536