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 10, 2023 15:05Kevin HeaveyKevin HeaveyScore: 341,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2023 15:05336,8492,869,556,6732,795,844,37302,191,360
2Jan 10, 2023 15:05340,1372,899,179,2562,823,133,73202,195,456
3Jan 10, 2023 15:05341,1262,889,079,9512,831,344,66602,256,896
4Jan 10, 2023 15:05341,3242,892,446,3692,832,988,53102,191,360
5Jan 10, 2023 15:05341,8272,902,054,3122,837,166,41702,195,456
6Jan 10, 2023 15:05342,5932,904,668,0992,843,519,49202,191,360