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 listApr 13, 2024 16:37E SequeiraE SequeiraScore: 19,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2024 16:3719,580216,513,922162,514,23502,347,008
2Apr 13, 2024 16:3719,674229,343,180163,294,70102,252,800
3Apr 13, 2024 16:3719,717234,403,999163,650,26802,351,104
4Apr 13, 2024 16:3719,872193,740,878161,941,0002,998,0002,473,984
5Apr 13, 2024 16:3719,874194,078,931162,952,0001,999,0002,519,040
6Apr 13, 2024 16:3719,900200,308,985163,164,0002,002,0002,297,856
7Apr 13, 2024 16:3719,921190,663,877164,345,0001,002,0002,519,040
8Apr 13, 2024 16:3719,971197,085,193163,761,0001,997,0002,482,176
9Apr 13, 2024 16:3720,023194,217,706163,192,0003,003,0002,478,080
10Apr 13, 2024 16:3720,093197,460,522163,773,0002,995,0002,519,040
11Apr 13, 2024 16:3720,126193,690,359167,043,00002,519,040
12Apr 13, 2024 16:3720,237203,537,277164,969,0002,999,0002,519,040