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 listJan 11, 2025 17:22Ian MckibbenIan MckibbenScore: 51,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 17:2251,315449,382,804424,919,000999,0002,289,664
2Jan 11, 2025 17:2251,337450,119,527424,097,0002,000,0002,281,472
3Jan 11, 2025 17:2251,383452,286,599425,478,0001,001,0002,371,584