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 22, 2026 22:55Victor MerckléVictor MerckléScore: 3,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 22:553,18833,557,38425,091,0001,052,0002,113,536
2Jun 22, 2026 22:553,21733,784,24225,317,0001,064,0002,113,536
3Jun 22, 2026 22:553,21933,808,32425,324,0001,073,0002,113,536
4Jun 22, 2026 22:553,22533,837,11625,382,0001,070,0002,113,536
5Jun 22, 2026 22:553,24434,062,47225,547,0001,058,0002,113,536
6Jun 22, 2026 22:553,27136,493,99025,793,0001,034,0002,113,536
7Jun 22, 2026 22:5512,092106,576,94898,143,0001,014,0002,113,536
8Jun 22, 2026 22:5512,119106,804,25298,368,0001,012,0002,113,536
9Jun 22, 2026 22:5512,156107,128,39398,674,0001,013,0002,113,536