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 listOct 1, 2024 21:57FaustVXFaustVXScore: 484,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2024 21:57483,6574,043,032,3953,912,447,000101,907,0002,367,488
2Oct 1, 2024 21:57484,0804,053,850,6543,929,932,00087,931,0002,449,408
3Oct 1, 2024 21:57484,0894,046,711,7233,914,015,000103,920,0002,351,104
4Oct 1, 2024 21:57484,0954,052,369,3773,913,064,000104,921,0002,461,696
5Oct 1, 2024 21:57484,3354,055,634,3463,922,057,00097,926,0002,478,080
6Oct 1, 2024 21:57484,4874,051,472,2973,911,341,000109,897,0002,351,104
7Oct 1, 2024 21:57484,5064,048,299,3243,913,469,000107,930,0002,465,792
8Oct 1, 2024 21:57484,5684,057,687,2113,911,998,000109,915,0002,363,392
9Oct 1, 2024 21:57486,4814,071,919,7633,936,874,000100,919,0002,461,696