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 10:23Huy Duc LeHuy Duc LeScore: 71,706Success
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 10:2371,699697,052,372595,104,64102,293,760
2Feb 7, 2024 10:2371,706654,536,639595,160,29002,289,664
3Feb 7, 2024 10:2371,838665,265,003596,257,49402,289,664