Output the largest number with the fewest digits

Question

Given a nonempty list of positive decimal integers, output the largest number from the set of numbers with the fewest digits.

The input list will not be in any particular order and may contain repeated values.

Examples:

[1] -> 1
[9] -> 9
[1729] -> 1729
[1, 1] -> 1
[34, 3] -> 3
[38, 39] -> 39
[409, 12, 13] -> 13
[11, 11, 11, 1] -> 1
[11, 11, 11, 11] -> 11
[78, 99, 620, 1] -> 1
[78, 99, 620, 10] -> 99
[78, 99, 620, 100] -> 99
[1, 5, 9, 12, 63, 102] -> 9
[3451, 29820, 2983, 1223, 1337] -> 3451
[738, 2383, 281, 938, 212, 1010] -> 938

The shortest code in bytes wins.

• seshoumara: Can the input numbers be on separate lines?
• Calvin's Hobbies: @seshoumara That sounds reasonable, yes.

Answer 1

Java 8, 110 bytes

int f(int[]a){java.util.Arrays.sort(a);int i=a[0];for(int z:a)i=(z+"").length()>(i+"").length()?i:z;return i;}

Ungolfed:

int f(int[]a){
 java.util.Arrays.sort(a); //sorts the array in ascending order
 int i=a[0]; //declare output variable, uses 1 less byte than using a[0]
 for(int z:a) {
 i=(z+"").length()>(i+"").length()?i:z; //for each int, if the length isn't longer set as output
 }
 return i;
}

Any elements that aren't longer in a sorted array must be a higher value.

Also lambda version (101 bytes):

a->{java.util.Arrays.sort(a);int i=a[0];for(int z:a)i=(z+"").length()>(i+"").length()?i:z;return i;};

Answer 2

Python 2, (削除) 63 (削除ここまで) (削除) 30 (削除ここまで) 63 bytes

lambda a:a.sort()or[`i`for i in a if len(`i`)==len(`a[0]`)][-1]

• orlp: Bugged for [1, 99, 620, 10000, 3].
• Destructible Lemon: I agree with orlp, doesn't work
• edc65: Once again, a wrong anser with an upvote? This should be amended or deleted

Answer 3

J-uby, 22 bytes

Port of my Ruby solution.

:max_by+-[S|:+@|:-@,I]

Attempt This Online!

Answer 4

Tcl, 93 bytes

proc D L {proc S x\ y {expr [string le $y]<=[string le $x]}
lindex [lsort -c S [lsort $L]] 0}

Try it online!

Answer 5

Perl 5, 38 + 3 (-pla flag) = 41 bytes

($_)=sort{$a=~y///c-length$b||$b-$a}@F

Try it online!

Answer 6

Perl 5, 34 + 4 (-plF ) = 38 bytes

$a[$#F]=$_ if$_>$a[$#F]}{$\=1*"@a"

Try it online!

Linear time based on the number of entries in the list. Memory space is proportional to the length of the longest number.

Answer 7

AWK, 54 bytes

n||n=99{(n>x=length)&&n=x;x-n||0ドル>r&&r=0ドル}END{print r}

Attempt This Online!

Takes input numbers on separate lines.

Answer 8

TI-84 BASIC (TI-84 Plus CE Python), 17 bytes

Input A
int(log(⸤A
max(⸤A*(Ans=min(Ans

gets the logarithm of each number in the list (int(log(⸤A), removes numbers that don't have the smallest amount of digits (⸤A*(Ans=min(Ans), and returns the max