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 listFeb 16, 2024 18:25RecursiveCatnipRecursiveCatnipScore: 37,697Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 18:0137,411379,366,501310,513,89402,232,320
2Feb 16, 2024 18:0137,684382,642,915312,775,89802,224,128
3Feb 16, 2024 18:2537,689381,560,884312,820,04902,224,128
4Feb 16, 2024 18:2537,693381,118,094312,856,00702,224,128
5Feb 16, 2024 18:2537,697380,613,095312,882,20702,232,320
6Feb 16, 2024 18:2537,702370,322,331312,929,45602,232,320
7Feb 16, 2024 18:0137,704365,177,523312,942,67402,228,224
8Feb 16, 2024 18:2537,706397,405,803312,958,37202,240,512
9Feb 16, 2024 18:2537,710377,709,158312,996,70702,232,320