HackerRank Diagonal Difference Problem Solution

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {

   int a[100][100],n,i,j,sum=0,s=0,t;
    scanf("%d",&n);
    t=n-1;
  
    for(i=0;i<n;i++)
        {
        for(j=0;j<n;j++)
            {
            scanf("%d",&a[i][j]);
                if(i==j)
                sum=sum+a[i][j];
                if(t==j)
                {
                s=s+a[i][j];
                t--;
            }
        }
        
    }
    printf("%d",abs(sum-s));
}

HackerRank Diagonal Difference Problem Solution Javascript

function processData(input) {
    var lines = input.split('\n')
    lines.shift()
    var diagA = 0
    var diagB = 0
    var line
    
    for (var i=0;i<lines.length; i++){
        var line = lines[i].split(' ')
        
        line = line.map(function(num) {return parseInt(num)})
        diagA+=line[i]
        diagB+=line[lines.length - 1 - i]
    }
    console.log(Math.abs(diagA-diagB))
} 

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
   processData(_input);
});