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 03:53Victor MerckléVictor MerckléScore: 3,433Success
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 03:543,39236,926,95426,744,0001,072,0002,113,536
2Jun 5, 2026 03:543,41137,075,90626,899,0001,072,0002,113,536
3Jun 5, 2026 03:543,41237,451,74426,946,0001,036,0002,113,536
4Jun 5, 2026 03:543,41637,114,32826,952,0001,066,0002,113,536
5Jun 5, 2026 03:543,43337,215,89527,110,0001,046,0002,113,536
6Jun 5, 2026 03:543,45837,457,44126,345,0002,016,0002,113,536
7Jun 5, 2026 03:543,47037,621,64027,402,0001,057,0002,113,536
8Jun 5, 2026 03:543,50737,865,76226,717,0002,047,0002,113,536
9Jun 5, 2026 03:543,53138,529,92127,908,0001,049,0002,113,536