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 listAug 23, 2026 14:31Victor MerckléVictor MerckléScore: 2,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 14:322,79931,069,83021,869,0001,084,0002,117,632stderr
2Aug 23, 2026 14:322,81431,185,03822,065,0001,017,0002,117,632stderr
3Aug 23, 2026 14:322,84232,127,10322,183,0001,129,0002,117,632stderr
4Aug 23, 2026 14:322,84732,872,24822,259,0001,091,0002,117,632stderr
5Aug 23, 2026 14:322,85631,592,29522,404,0001,017,0002,117,632stderr
6Aug 23, 2026 14:325,58054,799,20644,623,0001,135,0002,117,632stderr
7Aug 23, 2026 14:325,58054,014,57844,641,0001,118,0002,117,632stderr
8Aug 23, 2026 14:325,58153,900,80844,639,0001,129,0002,117,632stderr
9Aug 23, 2026 14:325,60054,241,33644,795,0001,132,0002,117,632stderr