blocks|key|1178143|text|欧姆v2，5字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1178144|`Σʾ|code-block|syntax|javascript|1178145|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nickbclifford/Ohm|1|https://tio.run/##y8/INfr/P@Hc4lP7oBQA^0|0|4|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/nickbclifford/Ohm" rel="nofollow noreferrer">Ohm v2</a>, 5 bytes</h1>
<pre><code>`Σʾ
</code></pre>
<p><a href="https://tio.run/##y8/INfr/P@Hc4lP7oBQA" rel="nofollow noreferrer" title="Ohm v2 – Try It Online">Try it online!</a></p>


blocks|key|1176103|text|Dyalog+Unicode，10+字节数+(SBCS)|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1176104|匿名默示前缀函数|unstyled|1176105|%2B/⎕UCS+⍝õÿ|code-block|syntax|javascript|1176106|在网上试试！|1176107|%2B加上/减少了⎕UCS通用字符集代码点。|style|CODE|1176108|⍝是注释符号，后两个字符是模糊的，达到11×1729。|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dyalog.com/|1|https://codegolf.meta.stackexchange.com/a/9429/43319|2|https://github.com/abrudz/SBCS|3|https://tio.run/##SyzI0U2pTMzJT///X1v/Ud/UUOdghUe9cw9vPbz/f9qjtgmPevsedTU/6l3zqHfLofXGj9omAhUFBzkDyRAPz@D/aQrqEZVR6lxAGl2/OpcGNlHNw9sNzY0sAQ^0|0|E|0|I|3|1|N|4|2|0|0|0|0|6|3|0|0|1|3|1|7|4|0|0|1^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]|$A|1A|B|1B|1|1C]|$A|1D|B|1E|1|1F]]|C|$]]|$1|D|3|E|5|F|7|1G|8|@]|9|@]|C|$]]|$1|G|3|H|5|I|7|1H|8|@]|9|@]|C|$J|K]]|$1|L|3|M|5|F|7|1I|8|@]|9|@$A|1J|B|1K|1|1L]]|C|$]]|$1|N|3|O|5|F|7|1M|8|@$A|1N|B|1O|P|Q]|$A|1P|B|1Q|P|Q]|$A|1R|B|1S|P|Q]]|9|@]|C|$]]|$1|R|3|S|5|F|7|1T|8|@$A|1U|B|1V|P|Q]]|9|@]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]|14|$5|V|W|X|C|$Y|15]]]]

<h1><a href="https://www.dyalog.com/" rel="nofollow noreferrer">APL (Dyalog Unicode)</a>, 10 <a href="https://codegolf.meta.stackexchange.com/a/9429/43319" title="When can APL characters be counted as 1 byte each?">bytes</a> (<a href="https://github.com/abrudz/SBCS" rel="nofollow noreferrer" title=".dyalog files using a single byte character set">SBCS</a>)</h1>

<p>Anonymous tacit prefix function</p>
<pre class="lang-apl prettyprint-override"><code>+/⎕UCS ⍝õÿ
</code></pre>
<p><a href="https://tio.run/##SyzI0U2pTMzJT///X1v/Ud/UUOdghUe9cw9vPbz/f9qjtgmPevsedTU/6l3zqHfLofXGj9omAhUFBzkDyRAPz@D/aQrqEZVR6lxAGl2/OpcGNlHNw9sNzY0sAQ" rel="nofollow noreferrer" title="APL (Dyalog Unicode) – Try It Online">Try it online!</a></p>
<p><code>+</code> plus <code>/</code> reduction over <code>⎕UCS</code> Universal Character Set code points.</p>
<p><code>⍝</code> is the comment symbol and the last two characters are fluff to reach 11×1729.</p>


blocks|key|1177001|text|Dyalog+Unicode，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1177002|%2B⌿⍉⊢⎕UCS

%2B⌿+⍝+Column+first+summation
++⍉+⍝+Transpose+(no-op)
+++⊢+⍝+Identity+function+(no-op)
++++⎕UCS+⍝+Universal+Character+Set+index+values|code-block|syntax|javascript|1177003|在网上试试！|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://www.dyalog.com/|1|https://tio.run/##SyzI0U2pTMzJT///P@1R2wTtRz37H/V2Pupa9KhvaqhzMFBUQT2iMkqdy9DcyFKhRgHIRVejDgA^0|0|E|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://www.dyalog.com/" rel="nofollow noreferrer">APL (Dyalog Unicode)</a>, 8 bytes</h1>

<pre class="lang-apl prettyprint-override"><code>+⌿⍉⊢⎕UCS

+⌿ ⍝ Column first summation
  ⍉ ⍝ Transpose (no-op)
   ⊢ ⍝ Identity function (no-op)
    ⎕UCS ⍝ Universal Character Set index values
</code></pre>
<p><a href="https://tio.run/##SyzI0U2pTMzJT///P@1R2wTtRz37H/V2Pupa9KhvaqhzMFBUQT2iMkqdy9DcyFKhRgHIRVejDgA" rel="nofollow noreferrer" title="APL (Dyalog Unicode) – Try It Online">Try it online!</a></p>


blocks|key|1176040|text|Python+3，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1176041|lambda+x:sum(map(ord,x))#Ԏ|code-block|syntax|javascript|1176042|在网上试试！|unstyled|1176043|程序输入的unicode和是3458，它是1729*2，并且是0x6C1或1729的整数倍。|style|CODE|1176044|简单的技巧，基本程序unicode+(lambda+x:sum(map(ord,x))#)+unicode之和为2164，然后3458-2164为1294，并在最终结果3458中添加chr(1294)+=+Ԏ！|entityMap|0|LINK|mutability|MUTABLE|url|https://docs.python.org/3/|1|https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUaHCqrg0VyM3sUAjvyhFp0JTU/lK3/@Cosy8Eo00DSU8ipQ0Nf8DAA^0|0|8|0|0|0|0|6|1|0|E|4|L|6|V|5|11|4|0|J|P|1R|9|2C|4|2J|9|2V|1^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@$A|1A|B|1B|N|O]|$A|1C|B|1D|N|O]|$A|1E|B|1F|N|O]|$A|1G|B|1H|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|K|7|1I|8|@$A|1J|B|1K|N|O]|$A|1L|B|1M|N|O]|$A|1N|B|1O|N|O]|$A|1P|B|1Q|N|O]|$A|1R|B|1S|N|O]]|9|@]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://docs.python.org/3/" rel="nofollow noreferrer">Python 3</a>, 27 bytes</h1>

<pre class="lang-python prettyprint-override"><code>lambda x:sum(map(ord,x))#Ԏ
</code></pre>
<p><a href="https://tio.run/##K6gsycjPM/6fZhvzPycxNyklUaHCqrg0VyM3sUAjvyhFp0JTU/lK3/@Cosy8Eo00DSU8ipQ0Nf8DAA" rel="nofollow noreferrer" title="Python 3 – Try It Online">Try it online!</a></p>
<p>Program inputted unicode sum is <code>3458</code> which is <code>1729*2</code>, and integral multiple of <code>0x6C1</code> or <code>1729</code></p>
<p>Trivial trick, base program unicode (<code>lambda x:sum(map(ord,x))#</code>) unicode sum is 2164, then <code>3458-2164</code> is 1294 and adding <code>chr(1294)</code> = <code>Ԏ</code> at the end results <code>3458</code>!</p>


blocks|key|1178457|text|红色，39字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1178458|func[s][n:+0+foreach+c+s[n:+n+%2B+c]n];ƈ|code-block|syntax|javascript|1178459|在网上试试！|unstyled|1178460|2+x+1729|entityMap|0|LINK|mutability|MUTABLE|url|http://www.red-lang.org/|1|https://tio.run/##K0pN@R@UmhIdy5Vm9T@tNC85ujg2Os9KwUAhLb8oNTE5QyFZoRgkkKegrZAcmxdrfazjf0FRZl6JQpqCEpEalLggOgzNjSwVtBSM/gMA^0|0|2|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="http://www.red-lang.org" rel="nofollow noreferrer">Red</a>, 39 bytes</h1>
<pre><code>func[s][n: 0 foreach c s[n: n + c]n];ƈ
</code></pre>
<p><a href="https://tio.run/##K0pN@R@UmhIdy5Vm9T@tNC85ujg2Os9KwUAhLb8oNTE5QyFZoRgkkKegrZAcmxdrfazjf0FRZl6JQpqCEpEalLggOgzNjSwVtBSM/gMA" rel="nofollow noreferrer" title="Red – Try It Online">Try it online!</a></p>
<p>2 x 1729</p>


blocks|key|1176427|text|Java，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1176428|s->s.codePoints().sum()//ը|code-block|syntax|javascript|1176429|在网上试试！|unstyled|offset|length|1176430|Java，20字节|1176431|ù->ù.chars().sum()|1176432|此方法不适用于所有Unicode字符。|1176433|entityMap|0|LINK|mutability|MUTABLE|url|https://tio.run/##fYyxCsIwFEX3fsWjUzI0/QC10MVJQaibOMTUltQ0Cb6XQpH@jz/k98SIzk6XC@ecQU6yGNpbVEYiwv6RgQ8XoxUgSUozOd3CKLUF1tBd2/50rnmiYEimCKSN6IJVpJ0VR7dztt/@7vrLV9DBJmJRoVCuvR6ctoSMCwwj42X5esZVqjUz0nUULpDwySJjWSek92au8RNl@Z9CznlqLNkS3w|1|https://tio.run/##bYyxDoIwFEV3vuKFqR14P6CSsDjphJtxqEW0WNqGvpIQw4cx82G1Rkenm5ucczoxiqJrnlFq4T0cXxm4cNVKgidBaUarGuiFMsBqGpS5ny8VTxR0ycRASmMbjCRlDZ7swZr7/ne3X76EFnZxXYpyXVA@xOAZRx96xuMmZerJ061HGwhdwkkb1qJwTk@V/9RY/k/NOU/ynM3xDQ^0|0|0|0|6|0|0|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|12|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|13|8|@]|9|@$J|14|K|15|1|16]]|A|$]]|$1|L|3|M|5|6|7|17|8|@]|9|@]|A|$]]|$1|N|3|O|5|D|7|18|8|@]|9|@]|A|$E|F]]|$1|P|3|Q|5|I|7|19|8|@]|9|@]|A|$]]|$1|R|3|H|5|I|7|1A|8|@]|9|@$J|1B|K|1C|1|1D]]|A|$]]]|S|$T|$5|U|V|W|A|$X|Y]]|Z|$5|U|V|W|A|$X|10]]]]

<h1>Java, 27 bytes</h1>
<pre><code>s-&gt;s.codePoints().sum()//ը
</code></pre>
<p><a href="https://tio.run/##fYyxCsIwFEX3fsWjUzI0/QC10MVJQaibOMTUltQ0Cb6XQpH@jz/k98SIzk6XC@ecQU6yGNpbVEYiwv6RgQ8XoxUgSUozOd3CKLUF1tBd2/50rnmiYEimCKSN6IJVpJ0VR7dztt/@7vrLV9DBJmJRoVCuvR6ctoSMCwwj42X5esZVqjUz0nUULpDwySJjWSek92au8RNl@Z9CznlqLNkS3w" rel="nofollow noreferrer">Try it online!</a></p>
<h1>Java, 20 bytes</h1>
<pre><code>ù-&gt;ù.chars().sum()
</code></pre>
<p>This method does not work for all Unicode characters.</p>
<p><a href="https://tio.run/##bYyxDoIwFEV3vuKFqR14P6CSsDjphJtxqEW0WNqGvpIQw4cx82G1Rkenm5ucczoxiqJrnlFq4T0cXxm4cNVKgidBaUarGuiFMsBqGpS5ny8VTxR0ycRASmMbjCRlDZ7swZr7/ne3X76EFnZxXYpyXVA@xOAZRx96xuMmZerJ061HGwhdwkkb1qJwTk@V/9RY/k/NOU/ynM3xDQ" rel="nofollow noreferrer">Try it online!</a></p>


blocks|key|1176144|text|杰夫特，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1176145|'ЌU¬mc+r%2B+
'Ќ++++++++//+Throwaway+one-letter+constant+to+pad+the+code+to+desired+length.
++U¬++++++//+Split+the+input+to+letters,
++++mc++++//+map+to+char+codes
+++++++r%2B+//+and+reduce+with+summation.|code-block|syntax|javascript|1176146|在这里试试。|unstyled|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/ETHproductions/japt|1|https://ethproductions.github.io/japt/?v=1.4.6&code=J1x1MDQwY1WsbWMgcis=&input=IidcdTA0MGNVrG1jIHIrIg==^0|0|3|0|0|0|0|6|1^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@$A|V|B|W|1|X]]|C|$]]|$1|D|3|E|5|F|7|Y|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]]|L|$M|$5|N|O|P|C|$Q|R]]|S|$5|N|O|P|C|$Q|T]]]]

<h1><a href="https://github.com/ETHproductions/japt" rel="nofollow noreferrer">Japt</a>, 11 bytes</h1>
<pre><code>'ЌU¬mc r+ 
'Ќ        // Throwaway one-letter constant to pad the code to desired length.
  U¬      // Split the input to letters,
    mc    // map to char codes
       r+ // and reduce with summation.
</code></pre>
<p><a href="https://ethproductions.github.io/japt/?v=1.4.6&amp;code=J1x1MDQwY1WsbWMgcis=&amp;input=IidcdTA0MGNVrG1jIHIrIg==" rel="nofollow noreferrer">Try it here.</a></p>


blocks|key|1176671|text|果冻+u，4字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1176672|؟OS|code-block|syntax|javascript|1176673|在网上试试！|unstyled|1176674|是如何工作的|1176675|首先，u标志告诉解释器将此编码解释为Unicode，而不是Jelly页，否则؟会破坏解释器：在网上试试！。|1176676|当程序实际运行时，؟是一个未识别的符号，因此会中断解析，迫使解析器将所有字符丢弃到؟，并开始使用OS解析一个新的链。|1176677|OS作为果冻程序来说是相当琐碎的：O，rdinals，然后S，嗯|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/DennisMitchell/jelly|1|https://tio.run/##y0rNyan8///GfP/g/xAKAA|2|https://tio.run/##S0oszvj/PzU5I19B6cZ8/2AlBTuFtMycVL2s1JycSi4wqZBWiiQGVQeTwpT5/x8A^0|3|1|0|2|0|0|0|0|6|1|0|0|3|1|12|1|1A|6|2|0|9|1|15|1|1C|2|0|0|2|H|1|T|1^^$0|@$1|2|3|4|5|6|7|16|8|@$9|17|A|18|B|C]]|D|@$9|19|A|1A|1|1B]]|E|$]]|$1|F|3|G|5|H|7|1C|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1D|8|@]|D|@$9|1E|A|1F|1|1G]]|E|$]]|$1|N|3|O|5|6|7|1H|8|@]|D|@]|E|$]]|$1|P|3|Q|5|M|7|1I|8|@$9|1J|A|1K|B|C]|$9|1L|A|1M|B|C]]|D|@$9|1N|A|1O|1|1P]]|E|$]]|$1|R|3|S|5|M|7|1Q|8|@$9|1R|A|1S|B|C]|$9|1T|A|1U|B|C]|$9|1V|A|1W|B|C]]|D|@]|E|$]]|$1|T|3|U|5|M|7|1X|8|@$9|1Y|A|1Z|B|C]|$9|20|A|21|B|C]|$9|22|A|23|B|C]]|D|@]|E|$]]]|V|$W|$5|X|Y|Z|E|$10|11]]|12|$5|X|Y|Z|E|$10|13]]|14|$5|X|Y|Z|E|$10|15]]]]

<h1><a href="https://github.com/DennisMitchell/jelly" rel="nofollow noreferrer">Jelly</a> <code>u</code>, 4 bytes</h1>
<pre><code>؟OS
</code></pre>
<p><a href="https://tio.run/##y0rNyan8///GfP/g/xAKAA" rel="nofollow noreferrer" title="Jelly – Try It Online">Try it online!</a></p>
<h2>How It Works</h2>
<p>First, the <code>u</code> flag tells the interpreter to interpret this encoding as Unicode, rather the Jelly code page, otherwise the <code>؟</code> breaks the interpreter: <a href="https://tio.run/##S0oszvj/PzU5I19B6cZ8/2AlBTuFtMycVL2s1JycSi4wqZBWiiQGVQeTwpT5/x8A" rel="nofollow noreferrer" title="Bash – Try It Online">Try it online!</a></p>
<p>When the program is actually run, <code>؟</code> is an unrecognised symbol, so breaks the parsing, forcing the parser to discard all characters up to the <code>؟</code> and begin parsing a new chain with <code>OS</code></p>
<p><code>OS</code> is fairly trivial as Jelly programs go: <code>O</code>rdinals then <code>S</code>um</p>


blocks|key|1176909|text|05AB1E，4+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1176910|总计为5*1729+=+8645。|unstyled|style|CODE|1176911|ÇO,₃|code-block|syntax|javascript|1176912|在网上试试！|1176913|Ç将输入字符串转换为unicode代码点列表，O对列表进行求和，,打印结果。₃将95推送到堆栈中，这不是隐式打印的，因为之前有显式输出。|1176914|这个程序用于查找代码页中的一对字符(,₃)，并使程序和为1729年的倍数。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##yy9OTMpM/f//cLu/zqOmZjgDAA|3|https://tio.run/##yy9OTMpM/f//6L4jbYfbXQ4v4jo1iUvBX@lwOxhrcykYmhtZqhoEctVyHV7@qGmNFxBXH555aPf//wA^0|0|6|0|9|3|1|0|3|D|0|0|0|6|2|0|0|1|N|1|W|1|12|1|0|I|2|0|4|3^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]|$A|1A|B|1B|1|1C]]|C|$]]|$1|D|3|E|5|F|7|1D|8|@$A|1E|B|1F|G|H]]|9|@]|C|$]]|$1|I|3|J|5|K|7|1G|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|1H|8|@]|9|@$A|1I|B|1J|1|1K]]|C|$]]|$1|P|3|Q|5|F|7|1L|8|@$A|1M|B|1N|G|H]|$A|1O|B|1P|G|H]|$A|1Q|B|1R|G|H]|$A|1S|B|1T|G|H]]|9|@]|C|$]]|$1|R|3|S|5|F|7|1U|8|@$A|1V|B|1W|G|H]]|9|@$A|1X|B|1Y|1|1Z]]|C|$]]]|T|$U|$5|V|W|X|C|$Y|Z]]|10|$5|V|W|X|C|$Y|11]]|12|$5|V|W|X|C|$Y|13]]|14|$5|V|W|X|C|$Y|15]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E" rel="nofollow noreferrer">05AB1E</a>, 4 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<p>Sums to <code>5*1729 = 8645</code>.</p>
<pre><code>ÇO,₃
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f//cLu/zqOmZjgDAA" rel="nofollow noreferrer" title="05AB1E – Try It Online">Try it online!</a></p>
<p><code>Ç</code> converts the input string to a list of unicode codepoints, <code>O</code> sums the list and <code>,</code> prints the result. <code>₃</code> pushes 95 to the stack, which is not printed implicitly since there was explicit output before.</p>
<p><a href="https://tio.run/##yy9OTMpM/f//6L4jbYfbXQ4v4jo1iUvBX@lwOxhrcykYmhtZqhoEctVyHV7@qGmNFxBXH555aPf//wA" rel="nofollow noreferrer">This program</a> was used to find a pair of characters (<code>,₃</code>) which are in the codepage and make the program sum to a multiple of 1729.</p>


blocks|key|1179208|text|因子+%2B+math.unicode，13字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1179209|[+Σ+dup+.o+]|code-block|syntax|javascript|1179210|在网上试试！|unstyled|1179211|解释：|1179212|它是一个函数，以序列作为输入，以八进制打印其和，并将十进制和作为输出返回。|1179213|[+...+]报价.存在于数据堆栈上的一种匿名函数，直到由组合器调用或使用为止。|unordered-list-item|1179214|Σ取序列之和(字符串是unicode代码点的序列)|1179215|数据堆栈上的dup重复对象|1179216|.o打印为八进制|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|https://tio.run/##S0tMLskv@h8a7OnnbqWQnVqUl5qjkJtYkqFXmpeZnJ@SqlBQlFpSUllQlJlXolCcWliampecWqxgzVWtoBRRGaWkoBStcG6xQkppgYJevkKskkLtfxSB/7mJQMZ/AA^0|5|C|0|2|0|0|0|0|6|1|0|0|0|0|7|0|0|1|0|6|3|0|0|2^^$0|@$1|2|3|4|5|6|7|19|8|@$9|1A|A|1B|B|C]]|D|@$9|1C|A|1D|1|1E]]|E|$]]|$1|F|3|G|5|H|7|1F|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1G|8|@]|D|@$9|1H|A|1I|1|1J]]|E|$]]|$1|N|3|O|5|6|7|1K|8|@]|D|@]|E|$]]|$1|P|3|Q|5|M|7|1L|8|@]|D|@]|E|$]]|$1|R|3|S|5|T|7|1M|8|@$9|1N|A|1O|B|C]]|D|@]|E|$]]|$1|U|3|V|5|T|7|1P|8|@$9|1Q|A|1R|B|C]]|D|@]|E|$]]|$1|W|3|X|5|T|7|1S|8|@$9|1T|A|1U|B|C]]|D|@]|E|$]]|$1|Y|3|Z|5|T|7|1V|8|@$9|1W|A|1X|B|C]]|D|@]|E|$]]]|10|$11|$5|12|13|14|E|$15|16]]|17|$5|12|13|14|E|$15|18]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a> + <code>math.unicode</code>, 13 bytes</h1>
<pre><code>[ Σ dup .o ]
</code></pre>
<p><a href="https://tio.run/##S0tMLskv@h8a7OnnbqWQnVqUl5qjkJtYkqFXmpeZnJ@SqlBQlFpSUllQlJlXolCcWliampecWqxgzVWtoBRRGaWkoBStcG6xQkppgYJevkKskkLtfxSB/7mJQMZ/AA" rel="nofollow noreferrer" title="Factor – Try It Online">Try it online!</a></p>
<h2>Explanation:</h2>
<p>It's a function that takes a sequence as input, prints its sum in octal, and returns the decimal sum as output.</p>
<ul>
<li><code>[ ... ]</code> A quotation. An anonymous function that lives on the data stack until called or used by a combinator.</li>
<li><code>Σ</code> take the sum of a sequence (a string is a sequence of unicode code points)</li>
<li><code>dup</code> duplicate object on top of the data stack</li>
<li><code>.o</code> print as octal</li>
</ul>


blocks|key|1179276|text|R，27字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1179277|sum(utf8ToInt(scan(,"ְ")))|code-block|syntax|javascript|1179278|在网上试试！|unstyled|1179279|scan的第二个参数需要是字符串，但可以是任何字符串。在代码高尔夫中，我们通常使用空字符串，但是这里使用由希伯来点舍瓦(U%2B05B0)+"ְ"组成的单字符字符串来表示和3458=1729*2。|style|CODE|entityMap|0|LINK|mutability|MUTABLE|url|https://www.r-project.org/|1|https://tio.run/##K/r/v7g0V6O0JM0iJN8zr0SjODkxT0NH6doGJU1NTbxyAA^0|0|1|0|0|0|0|6|1|0|0|4|1W|3^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@$A|18|B|19|N|O]|$A|1A|B|1B|N|O]]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://www.r-project.org/" rel="nofollow noreferrer">R</a>, 27 bytes</h1>

<pre class="lang-r prettyprint-override"><code>sum(utf8ToInt(scan(,&quot;ְ&quot;)))
</code></pre>
<p><a href="https://tio.run/##K/r/v7g0V6O0JM0iJN8zr0SjODkxT0NH6doGJU1NTbxyAA" rel="nofollow noreferrer" title="R – Try It Online">Try it online!</a></p>
<p>The second parameter of <code>scan</code> needs to be a string, but can be any string. In code golf, we usually use the empty string, but here using the single character string made of Hebrew Point Sheva (U+05B0) <code>&quot;ְ&quot;</code> makes the sum 3458=1729*2.</p>


blocks|key|1179032|text|木炭，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1179033|﹪…%25d⸿²ΣＥＳ℅ι|code-block|syntax|javascript|1179034|在网上试试！链接是详细的代码版本。解释：|unstyled|1179035|++++++++Ｓ+++Input+string
+++++++Ｅ++++Map+over+characters
++++++++++ι+Current+character
+++++++++℅++Ordinal+value
++++++Σ+++++Take+the+sum
﹪+++++++++++Perform+string+formatting
++%25d⸿+++++++Literal+string+`%25d\r`
+…+++²++++++Take+first+two+characters
++++++++++++Implicitly+print|1179036|稍微不那么令人满意的9字节版本：|1179037|→⭆¹ΣＥＳ℅λ↖|1179038|1179039|→|1179040|从左到右打印下一个值(即默认方向)。|1179041|⭆¹|1179042|将表达式转换为字符串。|1179043|ΣＥＳ℅λ|1179044|求和输入字符串的编码点。|1179045|↖|1179046|移动光标。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/z@gKDOvRMM3P6U0J1/DuTI5J9U5I79AQ0k1JaZISUfBSFNHIbg0V8M3sUDDM6@gtCS4BKghXQMo7F@UkpmXmKORqQkE1v//v9@56lHDMtWURzv2H9p0bvH7PUvf79n8qKX13M7/umU5AA|2|https://tio.run/##S85ILErOT8z5/z@gKDOvRMMqKDM9o0RHIbgEyE33TSzQMARySnM1QEzPvILSEoiMhqaOgn9RSmZeYo5GjiYIWHP55pelaliFFvikppVoWv///6ht0qO1bYd2nlv8fs/S93s2P2ppPbf7Udu0/7plOQA^0|0|2|0|0|0|0|6|1|0|0|0|0|0|6|2|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1J|8|@]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|D|3|E|5|F|7|1N|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1O|8|@]|9|@$A|1P|B|1Q|1|1R]]|C|$]]|$1|L|3|M|5|F|7|1S|8|@]|9|@]|C|$G|H]]|$1|N|3|O|5|K|7|1T|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1U|8|@]|9|@]|C|$G|H]]|$1|R|3|J|5|K|7|1V|8|@]|9|@$A|1W|B|1X|1|1Y]]|C|$]]|$1|S|3|T|5|F|7|1Z|8|@]|9|@]|C|$G|H]]|$1|U|3|V|5|K|7|20|8|@]|9|@]|C|$]]|$1|W|3|X|5|F|7|21|8|@]|9|@]|C|$G|H]]|$1|Y|3|Z|5|K|7|22|8|@]|9|@]|C|$]]|$1|10|3|11|5|F|7|23|8|@]|9|@]|C|$G|H]]|$1|12|3|13|5|K|7|24|8|@]|9|@]|C|$]]|$1|14|3|15|5|F|7|25|8|@]|9|@]|C|$G|H]]|$1|16|3|17|5|K|7|26|8|@]|9|@]|C|$]]]|18|$19|$5|1A|1B|1C|C|$1D|1E]]|1F|$5|1A|1B|1C|C|$1D|1G]]|1H|$5|1A|1B|1C|C|$1D|1I]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 11 bytes</h1>
<pre><code>﹪…%d⸿²ΣＥＳ℅ι
</code></pre>
<p><a href="https://tio.run/##S85ILErOT8z5/z@gKDOvRMM3P6U0J1/DuTI5J9U5I79AQ0k1JaZISUfBSFNHIbg0V8M3sUDDM6@gtCS4BKghXQMo7F@UkpmXmKORqQkE1v//v9@56lHDMtWURzv2H9p0bvH7PUvf79n8qKX13M7/umU5AA" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>
<pre><code>        Ｓ   Input string
       Ｅ    Map over characters
          ι Current character
         ℅  Ordinal value
      Σ     Take the sum
﹪           Perform string formatting
  %d⸿       Literal string `%d\r`
 …   ²      Take first two characters
            Implicitly print
</code></pre>
<p>Slightly less satisfying 9 byte version:</p>
<pre><code>→⭆¹ΣＥＳ℅λ↖
</code></pre>
<p><a href="https://tio.run/##S85ILErOT8z5/z@gKDOvRMMqKDM9o0RHIbgEyE33TSzQMARySnM1QEzPvILSEoiMhqaOgn9RSmZeYo5GjiYIWHP55pelaliFFvikppVoWv///6ht0qO1bYd2nlv8fs/S93s2P2ppPbf7Udu0/7plOQA" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. Explanation:</p>
<pre><code>→
</code></pre>
<p>Print the next value left-to-right (i.e. default direction).</p>
<pre><code>⭆¹
</code></pre>
<p>Cast the expression to string.</p>
<pre><code>ΣＥＳ℅λ
</code></pre>
<p>Sum the codepoints of the input string.</p>
<pre><code>↖
</code></pre>
<p>Move the cursor.</p>


blocks|key|1177108|text|红宝石，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1177109|->ab{ab.bytes.sum}|code-block|syntax|javascript|1177110|在网上试试！|unstyled|1177111|x="->ab{ab.bytes.sum}";f=eval(x);f[x]+#=>+1729|entityMap|0|LINK|mutability|MUTABLE|url|https://www.ruby-lang.org/|1|https://tio.run/##KypNqvyfZhvzX9cuMak6MUkvqbIktVivuDS39n@BQlq0UkRllFKsXkl@fLGGoZmmra26oVGSOhdYClOLUqytraG5keV/AA^0|0|3|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|F|7|15|8|@]|9|@]|C|$G|H]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://www.ruby-lang.org/" rel="nofollow noreferrer">Ruby</a>, 18 bytes</h1>

<pre class="lang-ruby prettyprint-override"><code>-&gt;ab{ab.bytes.sum}
</code></pre>
<p><a href="https://tio.run/##KypNqvyfZhvzX9cuMak6MUkvqbIktVivuDS39n@BQlq0UkRllFKsXkl@fLGGoZmmra26oVGSOhdYClOLUqytraG5keV/AA" rel="nofollow noreferrer" title="Ruby – Try It Online">Try it online!</a></p>
<pre class="lang-ruby prettyprint-override"><code>x=&quot;-&gt;ab{ab.bytes.sum}&quot;;f=eval(x);f[x] #=&gt; 1729
</code></pre>


<p><strong>Program:</strong> To count the sum of all Unicode characters of a given input.</p>
<p>(No need to display the output. The final answer can be calculated in any base no need to convert back to hexadecimal.)</p>
<p><strong>Test case</strong> : XyZ= 0058+0079+005A=012B</p>
<p><strong>Condition:</strong> If the program is inputted, then its output must be an integral multiple of 1729 (hex 06C1). (Sum of all characters <a href="https://en.wikipedia.org/wiki/Unicode" rel="noreferrer">(Unicode)</a> in the code must be equal to an integral multiple of 1729.)</p>
<p><strong>Winning criterion:</strong> code golf.</p>
<blockquote>
<p><a href="https://codegolf.meta.stackexchange.com/a/20918/101710">Sandbox</a></p>
</blockquote>


To count the sum of all Unicode characters of a given input under an interesting constraint

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

程序:计算给定输入的所有Unicode字符的总和。(不需要显示输出。最后的答案可以在不需要转换回十六进制的任何基中计算)。测试用例: XyZ= 0058+0079+005A=012B条件:如果输入程序，则其输出必须是1729 (十六进制06C1)的整数倍数。(代码中所有字符(Unicode)的总和必须等于整数倍数1729)。制胜标准:暗号高尔夫。沙盒

问在有趣的约束下计算给定输入的所有Unicode字符的总和
EN

回答 13

Code Golf用户

欧姆v2，5字节

Code Golf用户

Dyalog Unicode，10 字节数 (SBCS)

Code Golf用户

Dyalog Unicode，8字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问在有趣的约束下计算给定输入的所有Unicode字符的总和EN

回答 13

Code Golf用户

欧姆v2，5字节

Code Golf用户

Dyalog Unicode，10 字节数 (SBCS)

Code Golf用户

Dyalog Unicode，8字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问在有趣的约束下计算给定输入的所有Unicode字符的总和
EN