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 listJan 11, 2024 19:23hype.ethhype.ethScore: 86,042Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2024 19:1885,986775,007,016713,682,18602,224,128
2Jan 11, 2024 19:2386,001780,308,751713,810,88502,224,128
3Jan 11, 2024 19:1886,030774,299,265714,045,59602,224,128
4Jan 11, 2024 19:1886,042770,257,091714,146,01402,215,936
5Jan 11, 2024 19:2386,087774,080,459714,526,11702,224,128
6Jan 11, 2024 19:2386,292778,124,254716,220,11602,224,128