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 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 4, 2024 04:3100000Error: expected "53692581486973342 ", got "ok: 7861667456234986594 0100 0100 0000 1000 0000 0001 0000 0000 8 10 6 15936402 "
2Jun 4, 2024 04:3200000Error: expected "53689127247984171 ", got "ok: 7861667456234986594 1000 0000 1000 0000 0100 0001 0000 0000 8 5 8 25207955 "
3Jun 4, 2024 04:3200000Error: expected "53692492497726931 ", got "ok: 7861667456234986594 0100 0100 0000 1000 0000 0001 0000 0000 8 10 6 25770745 "