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 16, 2026 15:43Maya RebholzMaya RebholzScore: 45,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 16, 2026 15:4441,193347,021,399298,191,00039,597,0002,134,016
2Jun 16, 2026 15:4443,893369,146,027319,951,00039,974,0002,134,016
3Jun 16, 2026 15:4443,958369,703,027320,466,00039,993,0002,134,016
4Jun 16, 2026 15:4445,110379,207,702330,411,00039,492,0002,134,016
5Jun 16, 2026 15:4445,140379,808,290330,167,00039,982,0002,134,016
6Jun 16, 2026 15:4446,425390,462,195340,725,00039,961,0002,134,016
7Jun 16, 2026 15:4448,089403,582,957355,728,00038,603,0002,134,016
8Jun 16, 2026 15:4448,827409,669,013360,719,00039,666,0002,134,016
9Jun 16, 2026 15:4452,427439,779,360390,394,00039,509,0002,134,016