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 listApr 26, 2025 04:51KeefeKeefeScore: 20,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2025 04:5119,897193,047,671163,147,0002,001,0002,523,136
2Apr 26, 2025 04:5119,911188,823,659164,262,0001,001,0002,486,272
3Apr 26, 2025 04:5119,991191,913,962161,931,0003,998,0002,523,136
4Apr 26, 2025 04:5119,997191,553,660162,978,0002,999,0002,473,984
5Apr 26, 2025 04:5120,021196,666,674162,168,0004,004,0002,482,176
6Apr 26, 2025 04:5120,097195,701,222165,806,000998,0002,310,144
7Apr 26, 2025 04:5120,114199,041,933165,951,000999,0002,310,144
8Apr 26, 2025 04:5120,184193,581,735166,522,0001,003,0002,478,080
9Apr 26, 2025 04:5120,207193,911,592165,725,0001,996,0002,486,272