SIZECON - Size Contest

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

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

hide comments
2020-06-22 06:29:55
why is number showing instead of right or wrong answer? mine was 119
2020-05-24 10:28:18
229 in C++14
2020-05-19 18:48:59
111 in C++
2020-05-19 06:23:43
181 in Java! by limiting all the variable names and even the class name to 1 alphabet... I think that's the highest one can get with java, since the main void is so long (public static void main(String[] args))
2020-04-28 12:45:46
153 in c++
2020-03-26 17:47:49
137 in c
2020-02-22 00:54:36
182 in c++!
2020-01-01 14:57:32 Mariusz Jedlikowski
104 in C++

Last edit: 2020-01-01 16:52:15
2019-12-31 11:05:31
221 in C++

Last edit: 2019-12-31 11:06:46
2019-08-19 00:13:08
63 python

Last edit: 2019-08-19 00:14:28
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.