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:01Erdem KeskinErdem KeskinScore: 83,903Success
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 08:5183,875760,855,133696,162,37602,236,416
2Jul 3, 2023 08:4883,877754,036,292696,180,89202,232,320
3Jul 3, 2023 08:5583,879760,459,103696,191,55702,236,416
4Jul 3, 2023 08:4883,890766,190,415696,287,49602,240,512
5Jul 3, 2023 08:4883,892763,318,404696,302,30802,224,128
6Jul 3, 2023 08:5183,899752,261,486696,361,06602,236,416
7Jul 3, 2023 08:5583,903757,641,893696,397,10502,232,320
8Jul 3, 2023 09:0183,903761,086,467696,391,86402,228,224
9Jul 3, 2023 08:5583,941752,515,678696,711,59202,228,224
10Jul 3, 2023 09:0183,957754,193,695696,842,18202,232,320
11Jul 3, 2023 08:5183,983756,348,393697,062,87502,236,416
12Jul 3, 2023 09:0184,056749,209,782697,662,53402,232,320