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 22:03FaustVXFaustVXScore: 477,791Success
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 22:03474,7093,970,427,9433,828,167,000111,917,0002,502,656
2Oct 1, 2024 22:03475,1673,974,248,7713,816,988,000126,899,0002,457,600
3Oct 1, 2024 22:03475,3073,979,785,8783,850,120,00094,928,0002,351,104
4Oct 1, 2024 22:03475,6323,984,827,6433,843,830,000103,914,0002,465,792
5Oct 1, 2024 22:03477,7913,994,956,5543,854,728,000110,934,0002,514,944
6Oct 1, 2024 22:03477,8593,994,536,3373,852,306,000113,920,0002,523,136
7Oct 1, 2024 22:03480,8474,016,474,6963,888,110,000102,923,0002,506,752
8Oct 1, 2024 22:03481,7154,032,182,4933,895,309,000102,928,0002,486,272
9Oct 1, 2024 22:03483,0774,041,572,8623,923,615,00085,925,0002,355,200