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 8, 2024 04:31matsuoka-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 8, 2024 04:3100000Error: expected "53680940576998222 ", got "0 "stderr
2Jun 8, 2024 04:3700000Error: expected "53682143097738678 ", got "0 "stderr
3Jun 8, 2024 04:3900000Error: expected "53688675248514585 ", got "0 "stderr
4Jun 8, 2024 06:2600000Error: expected "53686150537017201 ", got "0 "stderr
5Jun 8, 2024 06:2800000Error: expected "53692887697232592 ", got "0 "stderr
6Jun 8, 2024 06:2800000Error: expected "53681139626294114 ", got "0 "stderr
7Jun 8, 2024 06:3200000Error: expected "53688713348683889 ", got "0 "stderr