A Very Big Sum
JoshuaLamusga I don't think that this problem needs to exist because it's redundant with the simple array sum challenge. All I did was change
sum's type frominttolongin Java, and the challenge even told me how.
diegovicen I completely agree with you. I am using Python, and all I had to do was copy and paste.
VRatr This was not the case in C++ if you're using accumulate().
long long int total = accumulate(arr.begin(),arr.end(), 0);which appears to overflow. I just iterated through the elements in a loop and summed the total instead.
gautam11681 Have you figured out why this happens? I even tried passing a custom function to do the addition and still it overflows!
razor123 The problem isn't meant to be solved using long integer. Use integer datatype to solve it. You may divide the bits and then add them seperately.
gautam11681 well i think you are forgetting about kiss
havoklord It is a problem that can be solved however you want. But if you look at the hint "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. " It would contradict what you said.
alextaylor Because the type of the accumulator that will be used to determine the sum is based on the type of the third input argument. The literal 0 is not being interpreted as long long int. If you cast the initial value to accumulate appropriately, you get the right answer.
accumulate(arr.begin(),arr.end(),static_cast<long long int>(0))alextaylor From http://stackoverflow.com/questions/8108642/type-of-integer-literals-not-int-by-default
"The type of an integer literal is the first of the corresponding list in Table 6 in which its value can be represented."
And Table 6, for literals without suffixes and decimal constants, gives:
int long int long long intSo, without the cast, the literal 0 can be represented as int, so accumulate uses int as the type for accumulation.
geodoom I think there is another way , to avoid the static_cast(0) , and do it by simply accumulate(....,0L); If I remember correct (I am too lazy to search in books or google now to verify!) the L forces the number to be interpreted as long long.
Gamenot L is the suffix for long just like LL is the suffix for long long. Weird but not confusing.
accumulate(....,0LL)avoids the static cast.
C_jain or we can do it more simply like this..
accumulate(arr.begin, arr.end(), (long long int)0);
trungskigoldberg Hi, I understand the 3rd argument of the function accumulate(), which indicates the type of integer literal in this case. But why we need to cast statically as
.....static_cast<long long int>(0))
for the long long integer?
C_jain i also don't know that why i cast it explicitly
Kanahaiya you can check out the below link for video explanation :)
Vidya35 long int result=0; cout<
This works for me in C++. No overflow.
terenceponce Same here with Ruby. I had to re-read the problem just to make sure that I wasn't reading the same thing.
mraemiller I tried it in pure C ...a world of pain! But here's the answer
int main(){ int n; long bign = 0; long bignn; scanf("%d",&n); long arr[n]; for(int arr_i = 0; arr_i < n; arr_i++){ scanf("%li",&arr[arr_i]); } for(int arr_i = 0; arr_i < n; arr_i++){ bign = bign + (arr[arr_i]) ; } printf("%ld\n", bign); return 0; }
ranju73 wow!
tej005 cool!! was missing 'li' and 'ld' in the scanf statements...'l' for long..!! thank you.
amantoor Thanks!
mickey_sweety not working
somayaji What's the reason for using two loops and an array? I feel like that just takes too much time and too much space. Here's my take in C if anyone's interested:
#include <stdio.h> int main(void){ int n; long sum=0; scanf("%d", &n); long value; //long arr[n]; for (int i=0; i < n; i++) { scanf("%li", &value); sum += value; } printf("%li", sum); return 0; }
apschauhan700 see full and easy to understand code on:
https://github.com/akkshaychauhan/hacckerank-code/blob/master/Algorithms:A%20Very%20Big%20Sum
thatsmemohit Not working ...is there any place where I can see answers ?
apschauhan700 Try long long int in place of int if you are using c
Kanahaiya you can check out the below link for video explanation :)
NiharPawade "a world of pain" - completely agree with you.
nikhil_lagwanka1 Does this work if you put the sum part under that function they have provided
eavestn I'm sure there's some fancy "stuff" you could do in a strongly typed language to determine the type of the result; however, I wonder what the performance implications of that would be versus just starting with type long. Don't know why you got downvoted (I don't write in Python).
ggiesawilson Yeah, it seems like the utility of the problem is language dependent. Python 3 doesn't differentiate between int and long types; they're handled exactly the same way from the users perspective.
scotmatson Yeah but your missing the point. Firstly a number of people are coming here with little to no experience and this is great practice for them.
The problem is clearly labeled as being easy, however maybe that didn't exist 2 years ago when this post was made.
And for people with more experience, it is an opportunity to play around.
Case in point:
def aVeryBigSum(n, ar): return reduce(lambda x, y: x + y, ar, 0) def reduce(func, arr, s): for v in arr: s = func(s, v) return s
sravanamrajesh1 super
DavonJG I didn't know long existed until this challenge...my teacher seemed to just have skipped right over it.
tanuj22333 [deleted]
tobywhughes I think it is useful at a basic cs level. The size of domains for different data types seems to be largely skimmed over in introductory cs classes.
Edit: Granted, in python int and long have been unified since python 2.4 so it was the same code
cli__ Yeah, I use bash shell and in bash variable has no type and can always use the largest integer.
nishant021088 could you please let me know how you did it? i am trying in bash,no success yet.
juan_villgs yep, just remove it..
mithuntnt Python 3 automagically supports indefinitely large interger operations.
rk235927 long result=0; long value=0; int n; Scanner scan=new Scanner(System.in); n=scan.nextInt(); for(int i=0;i
System.out.println(+result); } }
kesarims1 This challenge should be the very first challenge in the series.
KeshaCoder I'm new to HackerRank--why is there already code in the solution window? Shouldn't we be coding things from scratch?
zazaalaza I think it's because of how you get the data from the input, instead of you declaring it?
tgamerkle The code in the window is what the HackerRank server runs. You will write your code in the important-looking function that's mostly empty. ("main", or something). There might already be code there that declares some variables for you to use (like "arr" for an array of the numbers).
H4DH1 For people posting their codes, hit enter and tab the first line so it would look coherent.
{ CODE Like this }{ not like
this}
mramitkumar95 well, H4DH1 Although it might be your personal preference but the way
{not like
this} is industry standerd. So you should follow that, bcoz that will make ur life easier.MandoPelando That's not industry standard. H4D1 is correct. The way you have it gets really ugly and hard to read, so I would recommend you follow H4D1's recommendation; It could save you a lot of frustration.
sumitrai01 I agree, H4D1 is right. Properly indented code is more readable and maintainable. Now as far as standards are concerned, the classic The C Programming Language (Ansi C Version) by Kernighan and Ritchie recommends H4DH1's style.
rfpels Using regular English makes MY life easier. Yet another 'standard' I would like everybody to follow.
eavestn It's not "industry" standard: it is language, company, and - sometimes - even product influenced (notice I didn't say determined). The spacing of a language's brackets is entirely preference-based, even if coding conventions are encouraged by documentation (such as MSDN, Oracle, etc.). I've seen some bad stylings in my short time as a programmer.
MobilityWins This is actually worse and should not be an industry standard, this is how you get whats called "spaghetti code" because havign a lot of lines in this fashion will just look to jumbled and harder to debug.
tricerabottoms "Spaghetti code" refers to the look of the dependency graph, not the code.
waspnx [deleted]
modhassan Arrays.stream(scanner.nextLine().split(" ")).mapToLong(s -> Long.parseLong(s)).sum();
Zystx JS has a pretty one liner for this.
let result = arr.reduce((previous, current) => previous + current , 0); console.log(result);alexmeneses90 I had a very similiar answer.
console.log(arr.reduce((prev, curr) => prev + curr));
k_bazaraly This is awesome. Can you hint me where I can read more about operator
=>? Googling is not helpfulalexmeneses90 It's part of the ES6 standard you can check out some documentation and examples here MDN LINK
gene68 Same in C# LINQ: var sum = arr.Sum(a => (long) a);
charlie861i You can cut this down evern further, simply
static long aVeryBigSum(int n, long[] ar) { return ar.Sum(); }
tommasobertagnin Yes in JS it is a breeze to solve. These problems are really concerning those low level languages, like C, where even doing the most simple thing requires skills :)
navindrenjr Can be done in python as well
print reduce((lambda x, y: x + y ), arr)zyanting18 could you explain what this line is doing please? Thanks
hawner Reduce just takes a list of values and applies the lambda function to them to get one value at the end. Look up "reduce" in the python docs, or pretty much any website has a good explanation.
IronicPythonic Why not just use?
return(sum(ar))
baojianfei1208 at python3, you net add import as follow: from functools import reduce
tricerabottoms That's neither a one-liner nor a correct solution.
5 9007199254740992 1 1 1 1
subas113 Solve in C#
using System; using System.Collections.Generic; using System.IO; using System.Linq; class Solution {
static long aVeryBigSum(int n, long[] ar) { // Complete this function Int64 total = 0; for(int i=0; i < n; i++) { total +=ar[i]; } return total; } static void Main(String[] args) { int n = Convert.ToInt32(Console.ReadLine()); string[] ar_temp = Console.ReadLine().Split(' '); long[] ar = Array.ConvertAll(ar_temp,Int64.Parse); long result = aVeryBigSum(n, ar); Console.WriteLine(result); }}
hamann_james87 For the test cases privided it does, but what if the integers are incredibly long? JS can't handle integers with more than 15 characters, and returns approximations. You need to import a library like big-num or write a very complicated workaround to deal with large integers.
igagro C#
long[] arr2 = Array.ConvertAll(arr_temp, Int64.Parse); Console.WriteLine(arr2.Sum());
misoknr One thing is there is similar "challenge" already, although in this case number may be large, that's fine. It is EASY, but why would you give solver a hint about using specific type? Isn't it a point of a challange to find out for yourself that you need to use type that can hold large number? By revealing this in note, solving it is pointless. And this plagues many of the challenges here. Why give solver all the necessary hints right away is beyond me.
hossamrakha0 static long aVeryBigSum(int n, long[] ar) {
long finalNumber = 0; for(int i=0; i < n ; i++) { finalNumber += ar[i]; } return finalNumber;}
dniswhite how is this different than just doing a simple sum? I must be missing something.
I kept reading this over and over and was caught with confusion as to the purpose of the first variable?
mo12g13 My solution using java.
static long aVeryBigSum(int n, long[] ar) { // Complete this function long sum = Arrays.stream(ar).sum(); return sum; }
Sort 485 Discussions, By:
Please Login in order to post a comment