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 4, 2023 18:11Erdem KeskinErdem KeskinScore: 82,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2023 17:5182,512750,764,403684,848,93202,228,224
2Jul 4, 2023 17:5182,614752,368,834685,696,02502,240,512
3Jul 4, 2023 18:1182,705743,640,274686,455,21502,236,416
4Jul 4, 2023 17:5182,716740,533,328686,541,87202,232,320
5Jul 4, 2023 18:1182,721746,197,527686,585,54902,228,224
6Jul 4, 2023 18:1182,736765,207,635686,712,62902,232,320