SIZECON - Size Contest

no tags 

Given the set of integers, find the sum of all positive integers in it. Solutions can be sent in any language supported by SPOJ except Whitespace.

Input

t – number of test cases [t < 1000]
On each of next t lines given a integer N [-1000 <= N <= 1000]

Output

One integer equals to sum of all positive integers.

Score

Score equals to size of source code of your program except symbols with ASCII code <= 32.

Example

Input:
4
5
-5
6
-1

Output:
11

hide comments
Piotr KÄ…kol: 2011-05-13 12:53:20

@Danav - No. The longer Your source is, the more points You get BUT the LOWER is Your score. In other words, try to shorten Your code as much as possible.

512_I: 2011-05-13 07:45:16

i m 3000th solver :D

Danav: 2011-04-18 05:20:46

I don't get it, the bigger your source codes, the better your score??

Piotr KÄ…kol: 2011-04-17 08:41:21

Because whitespaces don't count into source code so in white space all users' score would be 0 and they would get 3 points.

Santiago Palacio: 2011-04-17 04:05:07

Why this cannot be solved in whitespace? who would rather to do it?


Added by:Roman Sol
Date:2005-06-23
Time limit:2s
Source limit:10000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET WHITESPACE
Resource:ZCon & RSDN