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:08metalcoffeemetalcoffeeScore: 513,846Success
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:09509,7594,301,816,4054,231,001,22902,236,416
2Dec 11, 2023 21:09510,0934,301,778,5084,233,772,02502,236,416
3Dec 11, 2023 21:08513,7534,331,241,1564,264,149,87802,244,608
4Dec 11, 2023 21:09513,8464,338,630,1134,264,918,24702,240,512
5Dec 11, 2023 21:08514,5834,335,033,9644,271,041,51202,232,320
6Dec 11, 2023 21:08515,0894,350,011,6814,275,238,95202,232,320