We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Warmup
  4. A Very Big Sum
  5. Discussions

A Very Big Sum

  • tricerabottoms + 2 comments

    That's neither a one-liner nor a correct solution.

    5
9007199254740992 1 1 1 1
    • subas113 + 2 comments

      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);
}

      }

      • gkr4u2008 + 0 comments

        Thanks for the solution..Keep it up.

      • caminone + 0 comments

        The exact same approach, I believe under the hood, for the aVeryBigSum function. Taking advantage of that System.Linq namespace.

        return ar.Sum();
    • xtrimf + 0 comments

      You are right. Better to use the "stint" library