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 11, 2025 09:32cdillondcdillondScore: 241,918Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2025 09:32241,5942,026,510,1061,908,270,00096,962,0002,330,624
2Jun 11, 2025 09:32241,8062,041,786,4881,923,035,00083,957,0002,334,720
3Jun 11, 2025 09:32241,8322,036,993,5441,926,241,00080,968,0002,330,624
4Jun 11, 2025 09:32241,8332,031,483,1381,923,250,00083,967,0002,338,816
5Jun 11, 2025 09:32241,9182,037,790,8381,889,985,000117,936,0002,527,232
6Jun 11, 2025 09:32242,0432,036,524,1981,909,958,00098,997,0002,519,040
7Jun 11, 2025 09:32242,0502,030,154,7911,911,065,00097,952,0002,330,624
8Jun 11, 2025 09:32242,5562,042,425,3951,906,253,000106,958,0002,523,136
9Jun 11, 2025 09:32244,9112,056,263,1701,944,816,00087,946,0002,334,720