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 listMay 4, 2025 05:38KeefeKeefeScore: 19,977Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2025 05:3819,880192,122,455164,000,0001,000,0002,478,080
2May 4, 2025 05:3819,896190,844,900163,134,0002,001,0002,482,176
3May 4, 2025 05:3819,920188,388,929163,332,0002,004,0002,293,760
4May 4, 2025 05:3819,970190,614,793164,757,000998,0002,473,984
5May 4, 2025 05:3819,977193,989,866162,814,0002,996,0002,519,040
6May 4, 2025 05:3820,038195,302,480162,306,0004,007,0002,523,136
7May 4, 2025 05:3820,049190,500,248166,406,00002,478,080
8May 4, 2025 05:3820,102195,459,977164,845,0001,998,0002,523,136
9May 4, 2025 05:3820,147192,397,736165,215,0002,002,0002,486,272