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 8, 2026 15:58Victor MerckléVictor MerckléScore: 3,848Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 15:593,79040,452,45930,047,0001,037,0002,113,536
2Jun 8, 2026 15:593,83140,570,85830,372,0001,047,0002,113,536
3Jun 8, 2026 15:593,83740,599,15030,432,0001,039,0002,113,536
4Jun 8, 2026 15:593,84040,942,41730,450,0001,041,0002,113,536
5Jun 8, 2026 15:593,84840,720,10530,502,0001,052,0002,113,536
6Jun 8, 2026 15:593,85540,741,53630,556,0001,057,0002,113,536
7Jun 8, 2026 15:593,86840,830,79330,691,0001,032,0002,113,536
8Jun 8, 2026 15:593,87140,872,38330,706,0001,041,0002,113,536
9Jun 8, 2026 15:593,94341,466,96531,296,0001,043,0002,113,536