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 listFeb 7, 2024 07:15unsatcoreunsatcoreScore: 12,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2024 07:1511,288153,794,91793,688,13502,289,664
2Feb 7, 2024 07:1511,321154,755,30793,963,48502,281,472
3Feb 7, 2024 07:1511,564158,832,99895,977,60202,256,896
4Feb 7, 2024 07:1512,204126,379,19599,288,0002,005,0002,289,664
5Feb 7, 2024 07:1512,263126,916,164100,782,000997,0002,519,040
6Feb 7, 2024 07:1512,274121,579,69899,875,0001,997,0002,281,472
7Feb 7, 2024 07:1512,275127,001,78999,885,0001,997,0002,523,136
8Feb 7, 2024 07:1512,293128,569,010100,034,0002,000,0002,514,944
9Feb 7, 2024 07:1512,329127,113,220101,329,0001,003,0002,289,664
10Feb 7, 2024 07:1512,382129,057,604101,777,000997,0002,289,664
11Feb 7, 2024 07:1512,439126,058,109101,239,0002,004,0002,510,848
12Feb 7, 2024 07:1512,515125,697,696102,873,000998,0002,527,232