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:16Victor MerckléVictor MerckléScore: 3,394Success
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:173,31834,768,20226,175,0001,036,0002,113,536
2Jun 12, 2026 06:173,32534,816,99326,199,0001,067,0002,113,536
3Jun 12, 2026 06:173,33934,919,60626,325,0001,060,0002,113,536
4Jun 12, 2026 06:173,39235,363,11426,775,0001,046,0002,113,536
5Jun 12, 2026 06:173,39435,540,78126,772,0001,065,0002,113,536
6Jun 12, 2026 06:173,42735,641,48427,067,0001,035,0002,113,536
7Jun 12, 2026 06:173,44336,102,62827,190,0001,048,0002,113,536
8Jun 12, 2026 06:173,47436,017,18327,448,0001,045,0002,113,536
9Jun 12, 2026 06:1712,814112,757,280102,892,0002,183,0002,113,536