GlulkAlex

def lonely_Integer(
  b: list# of int
) -> int:
    so_Far = set()
    answer = 0
    
    for n in b:
      if n in so_Far:
        so_Far.discard(n)
      else:  

GlulkAlex

import sys
import math

# Auto-generated code below aims at helping you parse
# the standard input according to the problem statement.

n = int(input())

# Write an action using print
# To debug: print("Debug messages...", file=sys.stderr)

GlulkAlex

GlulkAlex

object Solution {

    def main(args: Array[String]) {
        /* Enter your code here. 
        Read input from STDIN. 
        Print output to STDOUT. 
        Your class should be named Solution
        */
      ///>>> it seems that something faster than O(N) needed
      ///> QuickSortMerge may be ? O(N * log(N)) ???

GlulkAlex

import math._
import scala.util._

/**
 * Created by Alex on 20.06.15.
 */
/**
 * Auto-generated code below aims at helping you parse
 * the standard input according to the problem statement.
 **/