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:17matsuoka-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:1700000Error: expected "53692977309962532 ", got "114281966025839515 "stderr
2Jun 4, 2024 13:1700000Error: expected "53692972794741256 ", got "115001161161795896 "stderr
3Jun 4, 2024 13:1700000Error: No answer to stdout. Died or killed?stderr
4Jun 4, 2024 13:2000000Error: expected "53691406546812100 ", got "114782448609040382 "stderr
5Jun 4, 2024 13:2000000Error: expected "53692623487269405 ", got "81005760346152432 "stderr
6Jun 4, 2024 13:216,250109,811,58351,872,97302,248,704
7Jun 4, 2024 13:216,292125,172,74652,224,64302,256,896
8Jun 4, 2024 13:216,348112,288,99952,692,32902,252,800