Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listJan 1, 2026 19:32Josu San MartinJosu San MartinScore: 6,896Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:326,53085,069,10649,181,0005,018,0002,523,136
2Jan 1, 2026 19:326,54281,698,17450,279,0004,022,0002,330,624
3Jan 1, 2026 19:326,54975,954,34350,333,0004,026,0002,392,064
4Jan 1, 2026 19:326,88382,759,19756,129,0001,002,0002,510,848
5Jan 1, 2026 19:326,89182,473,25454,182,0003,010,0002,330,624
6Jan 1, 2026 19:326,89183,686,86355,191,0002,006,0002,502,656
7Jan 1, 2026 19:326,89683,011,12353,221,0004,016,0002,301,952
8Jan 1, 2026 19:326,90383,807,72554,277,0003,015,0002,318,336
9Jan 1, 2026 19:326,92481,845,32555,454,0002,016,0002,297,856
10Jan 1, 2026 19:326,92877,853,61254,479,0003,026,0002,293,760
11Jan 1, 2026 19:326,96887,317,56655,805,0002,029,0002,383,872
12Jan 1, 2026 19:326,97691,517,15455,908,0001,996,0002,457,600