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 listJun 5, 2024 04:18matsuoka-601matsuoka-601Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2024 04:1800000Error: expected "53690469470854418 ", got "104161287656475006 "stderr
2Jun 5, 2024 04:1800000Error: expected "53687373645330634 ", got "54088157307435694 "stderr
3Jun 5, 2024 04:1900000Error: expected "53691629756189511 ", got "117166856310361598 "stderr
4Jun 5, 2024 04:1900000Error: expected "53687554789192471 ", got "98654742967821741 "stderr
5Jun 5, 2024 04:2000000Error: expected "53692342687527135 ", got "97708746440138776 "stderr
6Jun 5, 2024 04:2000000Error: expected "53682579711280531 ", got "61594230124532466 "stderr
7Jun 5, 2024 04:2100000Error: expected "53692781421690826 ", got "81950626542918963 "stderr