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 5, 2026 04:19Victor MerckléVictor MerckléScore: 3,399Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 04:193,35236,600,86126,427,0001,062,0002,113,536
2Jun 5, 2026 04:193,38236,790,53725,664,0002,070,0002,113,536
3Jun 5, 2026 04:193,38336,851,05926,677,0001,069,0002,113,536
4Jun 5, 2026 04:193,39236,902,60526,750,0001,066,0002,113,536
5Jun 5, 2026 04:193,39937,003,21926,841,0001,035,0002,113,536
6Jun 5, 2026 04:193,40437,002,36726,870,0001,043,0002,113,536
7Jun 5, 2026 04:193,40737,031,69826,880,0001,064,0002,113,536
8Jun 5, 2026 04:193,41737,124,68726,987,0001,039,0002,113,536
9Jun 5, 2026 04:193,56438,352,77727,151,0002,078,0002,113,536