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 listJul 3, 2023 09:49Erdem KeskinErdem KeskinScore: 83,901Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2023 09:4983,880754,749,883696,202,16402,240,512
2Jul 3, 2023 09:0883,886760,882,010696,256,66202,236,416
3Jul 3, 2023 09:5383,895753,385,008696,328,51302,228,224
4Jul 3, 2023 09:0883,896761,069,157696,338,98302,244,608
5Jul 3, 2023 09:0883,901764,181,935696,378,01702,228,224
6Jul 3, 2023 09:5383,902758,604,582696,383,46702,236,416
7Jul 3, 2023 09:4983,959767,118,962696,862,81602,240,512
8Jul 3, 2023 09:5383,981756,019,642697,040,22502,236,416
9Jul 3, 2023 09:4984,130769,084,183698,279,80002,236,416