#! Build the new AoA of ranges by scanning the string records starts and length of string of 1's
my (@results, $start);
for (0 .. length $result) { #! Looking at each character in the result string in turn
	my $c = substr($result, $_, 1); #! Grab the char

	#! skip to the next char until we find a 1.
	next if not $start and $c ne '1';

	#! Record the start position if we found a 1 and we haven't already got a start.
	$start = $_ if $c eq '1' and not $start;

	#! Skip to the next char if we have start pos until we find the end (ne '1')
	next if $start and $c eq '1';

	#! We have a start and we found a non-'1', so we have an end...
	#! so push the start end pair onto the results array
	push @results, [$start, $_-1];

	#! and undef $start to continue the search.
	$start = undef;
}

#! Print out the inputs sorted for human consumption, though that isn't necessary of the algorithm
print map{local $"='-'; "[@$_] "} sort{ $a->[0] <=> $b->[0] } @ranges;  #!"
print '';

#! And the results
print map{local $"='-'; "[@$_] "}@results; #!"
print '';

__END__
c:\test>227155-3
[1-4] [6-9] [7-15] [10-15] [17-19] [20-24] [26-29] [30-33] [34-39] [35-45] [40-45] [43-47] [53-57] [58-59]

[1-4] [6-15] [17-24] [26-47] [53-59]


c:\test>