UVA 10019 - Funny Encryption Method

#include<stdio.h>
#include<math.h>
main()
{
long i,c;
scanf("%ld",&c);
for(i=1;i<=c;i++)
{
long a;
scanf("%ld",&a);
long a1[10000]={0},k=0,sum=0,b=a,b1[10000]={0},k1=0;
long k2=0,sum3=0,a2[10000]={0};
long j,sum1=0;
long sum2=0;
while(a!=0)
{
a1[k]=a%2;
sum=sum+a1[k];
a=a/2;
k++;
}
while(b!=0)
{
b1[k1]=b%10;
b=b/10;
k1++;

}
for(j=k1-1;j>=0;j--)
{
sum2=b1[j]*(pow(16,j)+.0000001);
sum1=sum1+sum2;
}

while(sum1!=0)
{
a2[k2]=sum1%2;
sum3=sum3+a2[k2];
sum1=sum1/2;
k2++;
}
printf("%ld %ld\n",sum,sum3);
}
}