Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func toInt(str string) int {
	n, _ := strconv.Atoi(str)
	return n
}

func main() {
	lst := make([]int, 0)
	for i := 0; i < 10; i++ {
		lst = append(lst, toInt(readLine()))
	}
	sort.Ints(lst)
	for i := 9; i > 6; i-- {
		fmt.Println(lst[i])
	}
}

Python: l = []

for _ in range(10):
  l.append(int(input()))
  
l.sort(reverse = True)

for ll in l[:3]:
  print(ll)

Python: list = []
for count in range(10):
    list.append(input())
list = sorted(list, key=int)
a = 9
for count in range(3):
    print(list[a])
    a -= 1

Python: h = []
for i in range(10):
    h.append(int(input()))
h.sort(reverse=True)
for i in range(3):
    print(h[i])

Python: m1 = 0;m2 = 0;m3 = 0
for i in range(1,11):
    m = int(input())
    if m>=m1:
        m3 = m2;m2 = m1;m1 = m
    elif m2<=m<m1:
        m3 = m2;m2 = m
    elif m3<=m<m2:
        m3 = m

print(m1)
print(m2)
print(m3)

Python: from sys import stdin

x = [int(input()) for i in range(10)]
x.sort().reverse()
for i in range(3):
    print(i)

Python: for h in sorted([int(input()) for i in range(10)], reverse = True)[:3]:
    print(h)

Python: list = []
for i in range(10):
    list.append(input())

list.sort(reverse = True)
for i in range(3):
    print(list[i])

Python: mountains = [0 for i in range(10)]
for i in range(10):
  mountains[i] = int(input())

highest1 = mountains[0]
if highest1 < mountains[1]:
  highest2 = highest1
  highest1 = mountains[1]
else:
  highest2 = mountains[1]

if highest1 < mountains[2]:
  highest2, highest3 = highest1, highest2
  highest1 = mountains[2]
elif highest2 < mountains[2]:
  highest3 = highest2
  highest2 = mountains[2]
else:
  highest3 = mountains[2]

for i in range(3,10):
  if highest1 < mountains[i]:
    highest1, highest2, highest3 = mountains[i], highest1, highest2
  elif highest2 < mountains[i]:
    highest2, highest3 = mountains[i], highest2
  elif highest3 < mountains[i]:
    highest3 = mountains[i]

print(highest1)
print(highest2)
print(highest3)

Python: height_list = []
for i in range(0, 10):
    height_list.append(int(input()))

height_list.sort()
height_list.reverse()

for height in height_list[:3]:
    print(height)

Python: values = []
for i in range(10):
    values.append(int(input()))

top3 = []
for i in range(3):
    Max = max(values)
    top3.append(Max)
    values.remove(Max)

print(''.join(str(x) + '\n' for x in top3))

Python: a = []
for i in range(0,10):
    a.append(int(input()))
    
a.sort();
print(a[9])
print(a[8])
print(a[7])

Python: [print(d) for i, d in enumerate(sorted([i for i in input() for _ in range(10)], reverse=True)) if i < 3]

Python: # -*- coding: utf-8 -*-

#a = [input() for i in range(N)]
#print a # [a1, a2, a3, ..., aN]

import sys

a = []
for line in sys.stdin:
    a.append(int(line))
#print a # [a1, a2, a3, ...]
a.sort(reverse=True)
print(a[0])
print(a[1])
print(a[2])

Python: N=10
i=0
I=[int(input()) for _ in range (N)]
I.sort()
for i in range(3):
    print(max(I))
    I.pop()

Python: hills=[]

for i in range(10):
    hills.append(int(input()))

for i in range(3):
    print(max(hills))
    hills.remove(max(hills))

Python: a=[]
for i in range(10):
    a.append(input())
a.sort()
a=a[::-1]
a=a[-4]
print(a[0])
print(a[1])
print(a[2])

Python: x=[]
for i in range(10):
    n=int(input())
    x.append(n)
    
#print(x)
print(max(x))
x.remove(max(x))
print(max(x))
x.remove(max(x))    
print(max(x))

Python: def main():
    number = []
    for i in range(10):
        num = int(input())
        number.append(num)


    numbers = number.sorted(number)
    print(numbers[9])
    print(numbers[8])
    print(numbers[7])




if __name__=='__main__':
    main()

Python: #!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

def qsort( a ):
	if not isinstance(a,list):
		raise TypeError('qsort can only sort \'list\'')
	if len(a) <= 1:
		return a
	p = a[0]
	for i in range(1,len(a)):
		if a[0] != a[i]:
			p = a[i]
			break
		elif i == len(a)-1:
			#all are same
			return a

	while True:
		i = 0
		j = len(a)
		for i in range( 0, len(a) ):
			if p <= a[i]:
				break
		for j in range( len(a)-1, -1, -1 ):
			if a[j] < p:
				break
		if i > j:
			a1 = qsort( a[:i] )
			a2 = qsort( a[i:] )
			a1.extend(a2)
			return a1
		else:
			tmp  = a[i]
			a[i] = a[j]
			a[j] = tmp

if __name__ == '__main__':
	m_list = []
	for i in range(0,10):
		m_list.append( int( sys.stdin.readline() ) )
	s = qsort(m_list)
	s.reverse()
	for i in range(0,3):
		print('{}'.format(s[i]))

Python: "\n".join(reverse(sort([input() for i in range(10)]))[:3])

Python: if __name__ == '__main__':
    hight = input().split()
    num = [int(n) for n in hight]
    print(sorted(num, reverse=True)[0])
    print(sorted(num, reverse=True)[1])
    print(sorted(num, reverse=True)[2])

Python: A=[]
for i in range(10):
	A.append(int(input()))
A.sort()
A.reverse()
for i in range(3):
	print(A[i])

Python: mountain_heights = []
for i in range(10):
    mountain_heights.append(int(input()))

for i in range(3):
    maximum = 0
    index = i
    for j in range(i, 10):
        if mountain_heights[j] > maximum:
            maximum = mountain_heights[j]
            index = j
    temp = mountain_heights[i]
    mountain_heights[i] = mountain_heights[index]
    mountain_heights[index] = temp
    print(maximum)

Python: h=[]
for i in range(10):
    h.append((int)(input()))
h.sort()
h.reverse()
for i in range(3):
    print(h[i])

Python: def qsort(l):
    if l == []: return []
    else:
        pv = l[0]
        left = []
        right = []
        for i in range(1, len(l)):
            if l[i] > pv:
                left.append(l[i])
            else:
                right.append(l[i])
        left = qsort(left)
        right = qsort(right)
        left.append(pv)
        return left + right

def main():
    lst = []
    for i in range(0, 10):
        lst.append(int(raw_input()))

    lst = qsort(lst)
    for i in range(0, 3):
        print(lst[i])

main()

Python: mountain = []
for i in range(10):
    mountain.append(int(input()))

for i in range(3):
    for j in range(i,10):
        if mountain[i] < mountain[j]:
            buff_mt = mountain[i]
            mountain[i] = mountain[j]
            mountain[j] = buff_mt

for i in range(3):
    print(mountain[i])

Python: lst = []

for i in range(10):
    lst.append(int(input()))
lst.sort()
print(lst[9])
print(lst[8])
print(lst[7])

Python: a=[]
for i in range(1,11):
    b=int(input())
    a.append(b)
a.sort(reverse=True)
for i in range(3):
    print(a[i])

Python: A = [int(input()) for i in range(10)]
for i in sorted(A)[:-4:-1]:
    print(i)

Python: h = []
for i in range (10):
    h.append((int)(input()))
h.sort()
h.reverse()
for i in range (3):
    print(h[i])

Python: from sys import stdin
highest = [0] * 3
for line in stdin:
    highest.append(int(line))
    highest.sort(reverse=True)
    highest = highest[:-1]
print('\n'.join(map(str, highest)))

Python: #coding:UTF-8

l = []
first = 0
second = 0
third = 0
for num in range(10):
    x = int(input())
    if x >  first:
        third = second
        second = first
        first = x
    elif x > second:
        third = second
        second = x
    elif x > third:
        thied = x
print(first)
print(second)
print(third)

Python: l = []
for i in range(0, 10):
    l.append(int(input()))
l.sort(reverse = True)
l = l[:3];
for j in l:
    print(j);

Python: Lheight = [int(input()) for i in range(10)]

Lheight.sort(reverse=True)
for j in range(3):
    print(Lheight[j])

Python: height=[]
for i in xrange(10):
    mountain=input()
    height.append(mountain)
height.sort()
height.reverse()
for i in xrange(3):
    print(height[i])