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 listFeb 16, 2024 08:58Huy Duc LeHuy Duc LeScore: 21,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 08:5821,145239,433,747175,506,65202,285,568
2Feb 16, 2024 08:5821,145234,859,501175,506,88102,289,664
3Feb 16, 2024 08:5821,187238,125,166175,855,00302,281,472