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 listDec 11, 2023 21:22metalcoffeemetalcoffeeScore: 510,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2023 21:22508,3384,275,947,1824,219,205,88402,236,416
2Dec 11, 2023 21:23508,8834,297,047,7244,223,727,69202,252,800
3Dec 11, 2023 21:23510,3214,301,877,0484,235,664,36502,228,224
4Dec 11, 2023 21:22510,4244,288,114,2294,236,517,75002,252,800
5Dec 11, 2023 21:23512,5294,312,390,2564,253,993,35802,240,512
6Dec 11, 2023 21:22529,6454,454,740,8624,396,053,00202,256,896