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 7, 2026 16:07Victor MerckléVictor MerckléScore: 3,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 16:103,35536,639,47626,464,0001,054,0002,113,536
2Jun 7, 2026 16:103,36836,722,97526,568,0001,055,0002,113,536
3Jun 7, 2026 16:103,38336,841,94026,677,0001,066,0002,113,536
4Jun 7, 2026 16:103,38736,912,88126,723,0001,055,0002,113,536
5Jun 7, 2026 16:103,39636,998,38926,777,0001,072,0002,113,536
6Jun 7, 2026 16:103,41637,118,00226,953,0001,062,0002,113,536
7Jun 7, 2026 16:103,48537,726,95927,548,0001,037,0002,113,536
8Jun 7, 2026 16:103,49137,721,15327,583,0001,048,0002,113,536
9Jun 7, 2026 16:106,62363,440,33153,295,0001,018,0002,113,536