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 06:32Victor MerckléVictor MerckléScore: 3,201Success
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 06:333,02232,673,79823,639,0001,149,0002,113,536
2Jun 28, 2026 06:333,03132,692,66623,707,0001,151,0002,113,536
3Jun 28, 2026 06:333,09233,242,33724,265,0001,093,0002,113,536
4Jun 28, 2026 06:333,11233,268,24524,469,0001,052,0002,113,536
5Jun 28, 2026 06:333,20134,119,97425,080,0001,172,0002,113,536
6Jun 28, 2026 06:3312,393109,449,031100,618,0001,007,0002,113,536
7Jun 28, 2026 06:3313,036114,730,120105,894,0001,007,0002,113,536
8Jun 28, 2026 06:3313,044114,840,706105,960,0001,007,0002,113,536
9Jun 28, 2026 06:3313,098115,275,870106,394,0001,012,0002,113,536