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 12, 2026 06:37Victor MerckléVictor MerckléScore: 3,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 06:383,33134,822,41226,264,0001,051,0002,113,536
2Jun 12, 2026 06:383,33434,850,23826,288,0001,053,0002,113,536
3Jun 12, 2026 06:383,36235,245,42026,520,0001,056,0002,113,536
4Jun 12, 2026 06:383,36335,072,62126,517,0001,060,0002,113,536
5Jun 12, 2026 06:383,36935,241,50226,580,0001,052,0002,113,536
6Jun 12, 2026 06:383,42636,138,51627,062,0001,034,0002,113,536
7Jun 12, 2026 06:383,47336,022,52827,416,0001,065,0002,113,536
8Jun 12, 2026 06:383,49736,348,25127,636,0001,041,0002,113,536
9Jun 12, 2026 06:386,57361,488,72052,884,0001,018,0002,113,536