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 12, 2026 06:32Victor MerckléVictor MerckléScore: 3,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:333,36635,227,46026,548,0001,054,0002,113,536
2Jun 12, 2026 06:333,41735,485,61326,964,0001,063,0002,113,536
3Jun 12, 2026 06:333,42035,518,27527,004,0001,048,0002,113,536
4Jun 12, 2026 06:333,42135,692,85627,016,0001,038,0002,113,536
5Jun 12, 2026 06:333,42435,604,11927,050,0001,034,0002,113,536
6Jun 12, 2026 06:333,43935,965,39327,140,0001,067,0002,113,536
7Jun 12, 2026 06:333,45735,845,95327,312,0001,042,0002,113,536
8Jun 12, 2026 06:3312,760112,240,164102,437,0002,197,0002,113,536
9Jun 12, 2026 06:3312,911113,523,558103,845,0002,032,0002,113,536