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 28, 2026 07:03Victor MerckléVictor MerckléScore: 3,156Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 07:043,11533,406,43524,519,0001,029,0002,113,536
2Jun 28, 2026 07:043,12233,498,51324,577,0001,029,0002,113,536
3Jun 28, 2026 07:043,15333,746,25824,829,0001,028,0002,113,536
4Jun 28, 2026 07:043,15533,817,22524,849,0001,029,0002,113,536
5Jun 28, 2026 07:043,15633,725,90424,856,0001,028,0002,113,536
6Jun 28, 2026 07:0412,067106,825,91097,947,0001,008,0002,113,536
7Jun 28, 2026 07:0412,217108,156,41299,176,0001,006,0002,113,536
8Jun 28, 2026 07:0412,618111,319,876102,468,0001,006,0002,113,536
9Jun 28, 2026 07:0412,655111,702,054102,772,0001,007,0002,113,536