-
Notifications
You must be signed in to change notification settings - Fork 0
/
a_very_big_sum.py
32 lines (23 loc) · 1023 Bytes
/
a_very_big_sum.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
# You are given an array of integers of size NN. You need to print the sum of
# the elements in the array, keeping in mind that some of those integers may be
# quite large.
# Input
# The first line of the input consists of an integer NN. The next line contains
# NN space-separated integers contained in the array.
# Constraints
# 1≤N≤10
# 0≤A[i]≤10**10
# Sample Input
# 5
# 1000000001 1000000002 1000000003 1000000004 1000000005
# Output
# Print a single value equal to the sum of the elements in the array. #
# In the above sample, you would print 50000000155000000015
# Note: The range of the 32-bit integer is (−2**31) to (2**31−1) or
# [−2147483648,2147483647](−231) to (231−1) or [−2147483648,2147483647].
# When we add several integer values, the resulting sum might exceed the above
# range. You might need to use long long int in C/C++ or
# long data type in Java to store such sums.
import sys
n = int(input().strip())
arr = [int(arr_temp) for arr_temp in input().strip().split(' ')]