input: Write a python function to determine if a provided list of integers is sorted in ascending order. The function will return False if there are multiple instances of the same number in the list. The list will contain only positive integers.
  assert is_in_order([5]) == True
  assert is_in_order([1, 2, 3, 4, 5]) == True
  assert is_in_order([1, 3, 2, 4, 5]) == False
  assert is_in_order([1, 2, 3, 4, 5, 6]) == True
  assert is_in_order([1, 2, 3, 4, 5, 6, 7]) == True
  assert is_in_order([1, 3, 2, 4, 5, 6, 7]) == False
  assert is_in_order([]) == True
  assert is_in_order([1]) == True
  assert is_in_order([3, 2, 1]) == False
  assert is_in_order([1, 2, 2, 2, 3, 4]) == False
  assert is_in_order([1, 2, 3, 3, 3, 4]) == False
  assert is_in_order([1, 2, 2, 3, 3, 4]) == True
  assert is_in_order([1, 2, 3, 4]) == True
output: def is_in_order(lst):
      if len(lst) != len(set(lst)):
          return False
      return lst == sorted(lst)