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 7, 2024 17:28GraceGraceScore: 80,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 17:2880,241729,720,958666,002,06102,260,992
2Jun 7, 2024 17:2880,249740,139,647666,068,40102,273,280
3Jun 7, 2024 17:2880,286727,261,257666,370,56502,269,184
4Jun 7, 2024 17:2880,287725,616,133666,383,58702,273,280
5Jun 7, 2024 17:2880,395738,025,437667,278,53402,273,280
6Jun 7, 2024 17:2880,404728,838,220667,350,52702,269,184
7Jun 7, 2024 17:2880,416728,664,798667,455,36902,281,472
8Jun 7, 2024 17:2880,427746,577,476667,545,91202,269,184
9Jun 7, 2024 17:2880,779728,928,064670,463,99802,260,992
10Jun 7, 2024 17:2880,806751,861,594670,687,14502,273,280
11Jun 7, 2024 17:2880,858746,315,824671,117,76602,256,896
12Jun 7, 2024 17:2882,346756,684,794683,475,56202,269,184