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 4, 2024 13:23matsuoka-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 4, 2024 13:2300000Error: expected "53686601967530313 ", got "65505586500060222 "stderr
2Jun 4, 2024 13:2300000Error: expected "53692670108981778 ", got "129901689385218630 "stderr
3Jun 4, 2024 13:3600000Error: expected "53692572907474244 ", got "78654484652621589 "stderr
4Jun 4, 2024 13:3700000Error: expected "53692902176754517 ", got "116149318035890775 "stderr
5Jun 4, 2024 13:3700000Error: expected "53691909509068090 ", got "82558000767989696 "stderr
6Jun 4, 2024 13:3800000Error: expected "53690002507594388 ", got "56546770148309039 "stderr
7Jun 4, 2024 13:246,204124,501,15851,491,80402,260,992
8Jun 4, 2024 13:246,214113,198,41851,573,20002,248,704
9Jun 4, 2024 13:246,265115,970,17551,998,66502,244,608