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 7, 2024 09:50Huy Duc LeHuy Duc LeScore: 58,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2024 09:5058,749546,671,435487,617,36802,289,664
2Feb 7, 2024 09:5058,834561,224,979488,325,52902,289,664
3Feb 7, 2024 09:5058,918543,697,353489,019,86302,297,856