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 27, 2024 15:04Joad NacerJoad NacerScore: 13,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 15:0413,949141,640,874113,784,0001,996,0002,379,776
2Apr 27, 2024 15:0413,951145,489,593114,794,000998,0002,265,088
3Apr 27, 2024 15:0413,951141,739,211113,797,0001,996,0002,285,568
4Apr 27, 2024 15:0413,952146,350,700113,806,0001,996,0002,371,584
5Apr 27, 2024 15:0413,954173,878,045115,815,21802,293,760
6Apr 27, 2024 15:0413,955147,232,873113,830,0001,997,0002,514,944
7Apr 27, 2024 15:0413,956153,148,243114,833,000998,0002,285,568
8Apr 27, 2024 15:0413,983141,121,617114,062,0002,001,0002,285,568
9Apr 27, 2024 15:0413,997137,962,344114,176,0002,003,0002,514,944
10Apr 27, 2024 15:0414,004175,063,048116,231,18302,289,664
11Apr 27, 2024 15:0414,162182,920,538117,543,40002,273,280
12Apr 27, 2024 15:0414,472146,817,612118,113,0002,001,0002,285,568