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 listAug 11, 2025 17:25Ian MckibbenIan MckibbenScore: 12,791Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:2512,775125,871,785105,031,0001,000,0002,531,328
2Aug 11, 2025 17:2512,791130,559,268105,165,0001,001,0002,433,024
3Aug 11, 2025 17:2513,076129,929,735108,534,00002,510,848