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:59Victor MerckléVictor MerckléScore: 3,429Success
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:593,41637,129,15326,984,0001,034,0002,113,536
2Jun 5, 2026 03:593,41637,144,27326,979,0001,037,0002,113,536
3Jun 5, 2026 03:593,41837,198,35126,978,0001,056,0002,113,536
4Jun 5, 2026 03:593,42537,173,34627,052,0001,034,0002,113,536
5Jun 5, 2026 03:593,42937,250,49127,073,0001,047,0002,113,536
6Jun 5, 2026 03:593,44837,374,18326,250,0002,024,0002,113,536
7Jun 5, 2026 03:593,50537,820,60627,694,0001,053,0002,113,536
8Jun 5, 2026 03:5913,528120,085,264108,901,0002,029,0002,113,536
9Jun 5, 2026 03:5913,556120,306,493108,901,0002,261,0002,113,536