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 17, 2023 18:30Kevin HeaveyKevin HeaveyScore: 48,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2023 18:3148,133471,156,391399,503,77902,228,224
2Jan 17, 2023 18:1948,142482,708,369399,579,70002,232,320
3Jan 17, 2023 18:3148,160463,400,095399,728,82002,228,224
4Jan 17, 2023 18:3148,162465,264,154399,743,27502,228,224
5Jan 17, 2023 18:1948,165479,104,018399,772,64602,220,032
6Jan 17, 2023 18:3048,169468,924,845399,806,83602,256,896
7Jan 17, 2023 18:3048,170461,291,522399,811,10302,220,032
8Jan 17, 2023 18:3048,178458,340,902399,873,64002,224,128
9Jan 17, 2023 18:1948,181463,595,895399,905,05402,232,320