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 23, 2026 14:12Victor MerckléVictor MerckléScore: 9,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2026 14:129,39884,980,90076,052,0001,013,0002,117,632stderr
2Jun 23, 2026 14:129,42384,960,74275,240,0002,029,0002,117,632stderr
3Jun 23, 2026 14:129,43685,030,80576,367,0001,013,0002,117,632stderr
4Jun 23, 2026 14:129,44185,223,47676,408,0001,012,0002,117,632stderr
5Jun 23, 2026 14:129,46185,567,62776,567,0001,014,0002,117,632stderr
6Jun 23, 2026 14:129,47685,382,29475,684,0002,020,0002,117,632stderr
7Jun 23, 2026 14:129,47985,373,54975,697,0002,036,0002,117,632stderr
8Jun 23, 2026 14:129,57286,113,41576,406,0002,090,0002,117,632stderr
9Jun 23, 2026 14:129,69787,072,22578,506,0001,016,0002,117,632stderr