We develop optimal probability loading for parallel binary channels, subject to a constraint on the total probability of sending ones. The distinctions from the waterfilling power loading for parallel Gaussian channels, particularly the latter's "dropping" of poor-quality channels, are highlighted. The only binary-input binary-output channel that is never dropped is the Z-channel.