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 2, 2022 04:22vgatherpsvgatherpsScore: 32,084Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 2, 2022 04:2232,032330,724,310265,863,92202,228,224
2Dec 2, 2022 04:2232,065317,308,999266,138,26902,232,320
3Dec 2, 2022 04:2232,075327,932,298266,221,61302,220,032
4Dec 2, 2022 04:2232,084322,120,388266,294,72902,215,936
5Dec 2, 2022 04:2232,087326,958,554266,320,62202,228,224
6Dec 2, 2022 04:2232,090332,289,553266,343,95202,220,032