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 28, 2023 06:49Harsh SinhaHarsh SinhaScore: 63,143Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2023 06:4963,055581,031,489523,357,64902,269,184
2Dec 28, 2023 06:5063,130581,289,267523,980,86202,256,896
3Dec 28, 2023 06:5063,131579,785,257523,984,88102,265,088
4Dec 28, 2023 06:5063,143598,089,278524,082,99102,252,800
5Dec 28, 2023 06:4963,209598,834,114524,632,63702,260,992
6Dec 28, 2023 06:4963,266579,207,962525,104,12602,269,184