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 11:07matsuoka-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 11:0700000Error: No answer to stdout. Died or killed?
2Jun 5, 2024 11:0800000Error: expected "53691569160011708 ", got "89007833946275268"
3Jun 5, 2024 11:0800000Error: expected "53690355340527693 ", got "76032064043098093"
4Jun 5, 2024 11:0900000Error: expected "53689295147766967 ", got "94682540853946667"
5Jun 5, 2024 11:086,073105,867,09250,407,67102,252,800
6Jun 5, 2024 11:086,075101,971,42850,423,30902,252,800
7Jun 5, 2024 11:086,183111,914,95351,317,15302,252,800