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 14, 2025 05:21Andrija ZarićAndrija ZarićScore: 55,213Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 05:2155,175481,798,368456,956,000999,0002,285,568
2Aug 14, 2025 05:2155,180479,926,645456,996,000999,0002,289,664
3Aug 14, 2025 05:2155,198483,447,178457,142,0001,000,0002,363,392
4Aug 14, 2025 05:2155,211486,045,819457,252,0001,000,0002,289,664
5Aug 14, 2025 05:2155,213480,674,173457,268,0001,000,0002,289,664
6Aug 14, 2025 05:2155,218479,614,346458,309,00002,289,664
7Aug 14, 2025 05:2155,219482,256,999458,318,00002,289,664
8Aug 14, 2025 05:2155,239485,973,297458,482,00002,289,664
9Aug 14, 2025 05:2155,255496,227,361457,615,000999,0002,289,664