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 16, 2025 19:23ttmxttmxScore: 60,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2025 19:2360,728528,117,060502,045,0002,000,0002,285,568
2Jan 16, 2025 19:2360,731528,514,967502,064,0002,000,0002,273,280
3Jan 16, 2025 19:2360,740527,969,105502,144,0002,000,0002,527,232
4Jan 16, 2025 19:2360,741525,405,597502,153,0002,000,0002,285,568
5Jan 16, 2025 19:2360,747527,286,616502,197,0002,000,0002,297,856
6Jan 16, 2025 19:2360,748524,349,281503,212,0001,000,0002,285,568
7Jan 16, 2025 19:2360,757525,946,204503,281,0001,000,0002,273,280
8Jan 16, 2025 19:2360,762528,706,557503,326,0001,000,0002,523,136
9Jan 16, 2025 19:2360,797531,657,563503,612,000999,0002,355,200