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:45Victor MerckléVictor MerckléScore: 3,612Success
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:453,54836,515,94728,053,0001,041,0002,113,536
2Jun 22, 2026 22:453,57336,956,07928,272,0001,028,0002,113,536
3Jun 22, 2026 22:453,57636,752,75128,277,0001,047,0002,113,536
4Jun 22, 2026 22:453,60838,439,00628,533,0001,057,0002,113,536
5Jun 22, 2026 22:453,61237,057,07528,572,0001,052,0002,113,536
6Jun 22, 2026 22:453,61237,109,52828,562,0001,057,0002,113,536
7Jun 22, 2026 22:453,62437,172,78728,658,0001,063,0002,113,536
8Jun 22, 2026 22:453,65437,330,36228,936,0001,033,0002,113,536
9Jun 22, 2026 22:4512,937113,550,215105,070,0001,014,0002,113,536