Convert superscript numbers to normal numbers

Question 1

Introduction

My gnome friends are writing a programming language and have asked for my help. Due to their size, the gnomes can only handle small superscript numbers instead of big numbers. However, the language they're writing the interpreter in only accepts big numbers!

Your Challenge

Given an input of a superscript number (a series of characters that can be any of ⁰¹²³⁴⁵⁶⁷⁸⁹), convert it to normal ASCII numbers and print the result. This is code golf, so shortest answer wins!

Test Cases

¹ -> 1⁵ -> 5¹²³ -> 123⁶⁵⁵³⁵ -> 65535⁰¹²³ -> 123

Question 2

The reason that I ask is that I'm not absolutely confident that by copy-pasting from your question in my internet browser will give the correct characters. Please could you specify in the question exactly what the characters should (or could) be?

Question 3

@DominicvanEssen Sure. The characters have unicode codepoints 2070, 00B9, 00B2, 2074, 2075, 2076, 2077, 2078, and 2079.

Question 4

Can we return a list of digits?

Question 5

The new test case is invalidating most answers. :-/

Question 6

ord(⁰) = 8304,ord(¹) = 185,ord(²) = 178... Unicode, you're drunk. -.-

Question 7

JavaScript, 20 bytes

s=>s.normalize`NFKD`

Try it online!

Question 8

+1 for finding the builtin.

Question 9

+s.normalize… to remove leading zeros

Question 10

JavaScript (ES6), 43 bytes

Edit: +1 to support0123 ->123 ...

s=>+s.replace(/./g,c=>c.charCodeAt()%92%12)

Try it online!

Conversion table

 char. | code | mod 92 | mod 12-------+------+--------+--------  '⁰'  | 8304 |   24   |   0  '¹'  |  185 |    1   |   1  '²'  |  178 |   86   |   2  '³'  |  179 |   87   |   3  '⁴'  | 8308 |   28   |   4  '⁵'  | 8309 |   29   |   5  '⁶'  | 8310 |   30   |   6  '⁷'  | 8311 |   31   |   7  '⁸'  | 8312 |   32   |   8  '⁹'  | 8313 |   33   |   9

Question 11

For the second one, you can get away withc/58&c .

Question 12

@dingledooper Nice one! There's alsoc%12&c (found by Lynn). Unfortunately, the challenge update and OP comments suggest that this kind of answer is not valid anymore, so I'm removing it for now.

Question 13

Hexagony, side length 4, 37 bytes

92},/%=\_@=..}{<.{\<.>".2//{%.1!}>'/_

Unwrapped code:

    9 2 } ,   / % = \ _  @ = . . } { < . { \ < . >  " . 2 / / {   % . 1 ! }    > ' / _

Try it on hexagony.net

This is my first post on Code Golf, and first time using Hexagony. It's as painful as the name implies, but so satisfying to get a result! I ended up with more mirrors than I expected, but I'm pretty proud of what I achieved.

Credit to the previous users who worked out the modulo trick. My hexagon would have been a lot bigger without%92%12!

Question 14

Welcome to Code Golf! I haven't seen a Hexagony answer in ages, glad to see more usage of it!

Question 15

It's rare to see a first post in Hexagony so well done! It doesn't look like⁰ is handled correctly though: for inputs of¹⁰ and¹⁰¹ I'm seeing outputs of1 and11, respectively.

Question 16

Oh yeah! my test case started with ⁰, so I just didn't print it in order to stop leading zeroes from printing. I'll have to go back and fix it :)

Question 17

I think the hexagony.net interpreter has changed to use byte by byte input now, but this should still work for codepoint inputs

Question 18

Jelly, 7 bytes

O%12&ƊḌ

Try it online!

O         Get ordinal values %12&Ɗ    Apply x ↦ x%12&x      Ḍ   Digits to number

I found thex%12&x formula by computer search. If I/O were super duper lenient, I guess%12& would be a valid 4-byte answer.

Question 19

R,4553 51 bytes

Edit +8 bytes to comply with the updated rules (0123 ->123), but then -2 bytes thanks to pajonk

function(s)el(chartr("⁰¹²³⁴-⁹","0-9",s):1)

Try it online!

R,5351 57 bytes /25 bytes with IO as character codes

Edit: -4 bytes thanks to pajonk, but then +6 bytes (again thanks to pajonk) to comply with the updated rules

function(s,x=utf8ToInt(s))el(intToUtf8(x%%64-8*!x-185):1)

Try it online!

Function without multi-byte character codes, but sadly the verboseutf8ToInt andintToUtf8 function names make it quite long if we want to accept input directly as a string...

The new rule that⁰¹²³ should output123 invalidates the second version with IO as character codes. It could be fixed for+17 bytes, but it's shorter to completely change approach (below), portingArnauld's charcode-to-digit method.

R, 40 bytes with IO as character codes

function(c)c%%92%%12%*%10^rev(seq(!c)-1)

Try it online!

Question 20

You could save some bytes by I/O as char codes (as is by default allowed for string challenges) by removingutf8ToInt andintToUtf8.

Question 21

@pajonk - That's an excellent suggestion. Thankyou. Now suddenly the nicer function seems more competitive...!

Question 22

(c==185) ->!c-185 for -2.

Question 23

@pajonk - Neat! Thanks again!

Question 24

-2 bytes for thechartr method withel(<string>:0).

Question 25

Charcoal, 2 bytes

ＩＶ

Try it online! Explanation:

 Ｖ  Eval as a Charcoal integer literalＩ   Cast to string    Implicitly print

Question 26

verbose code in charcoal?

Question 27

@Fmbalbuena Correct me if I'm wrongNeil, but I don't think this program is possible in Verbose Charcoal, since it only has explicit inputs. So it would beCast(Evaluate(StringInput())) orCast(Evaluate(q)), which would actually beＩＶＳ orＩＶθ instead ofＩＶ. Unless there is a way for implicit inputs in Verbose Charcoal I'm unaware of, perhaps with a certain flag-argument?

Question 28

Ha! Right language for the job. :)

Question 29

@KevinCruijssen TechnicallyCast Evaluate will parse in Verbose mode, but it doesn't really read like normal Verbose Charcoal, so I don't bother in such a case.

Question 30

Python 3.8 (pre-release),46 50 bytes

-1 thanks to ovs!

lambda x:int(x.translate('%7d   45678923'%10*999))

Try it online!

Helper program to generate this:helper

Question 31

you need anint() around the whole thing

Question 32

@Razetime other people are outputting as a string so I thought that was alright maybe

Question 33

You can save a byte with'%7d 45678923'%10*999. But with according to the new test case you will have to addint(...).

Question 34

@ovs nice, clever

Question 35

Raku,¹⁴¹⁰¹¹ 8 bytes

+1 and +4 to remove leading 0's.

-3 bytes thanks toMoonchild!

+~*.NFKD

Try it online!

Raku`-p`,1519 bytes

-1 byte and -1 flag thanks toJo King!

$_=+S:g{.}=$/.EVAL

Try it online!

Raku uses superscript digits as exponents, but single digits on their own evaluate to their numeric value.

Question 36

Can you not then take the 2-log of 2 with that exponent?

Question 37

@Adám Yes that would work, but I think I still needEVAL, and the shortest I can do is{log2 EVAL 2~$_} at 16 bytes (Doesn't work on TIO because of old version)

Question 38

@Adám that would be shorter with removing leading zeros, but as it is not working on TIO and returnsInf for the largest case, I'm not going to include it.{-1+chars EVAL 10~$_} would fix those issues, but is longer again.

Question 39

I think you can shave off a couple of characters with+~*.NFKD

Question 40

You can use$/ instead of$<> andEVAL as a method to remove that extra flag. I really wish you could doS:g{.}.=&EVAL though

Question 41

C (gcc),^{83\$\cdots\$60} 46 bytes

n;f(int*s){for(n=0;*s;)n+=9*n+*s++%92%12;n=n;}

Try it online!

Inputs a pointer to awchar_t string of superscript numbers.
Returns the normal number.

Discovered then % 92 % 12 formula independently.

Question 42

JavaScript,656261 60 bytes

s=>s.replace(/./g,x=>-~'¹²³⁴⁵⁶⁷⁸⁹'.search(x))

Saved 3 bytes thanks toNeil.

Saved 1 byte thanks toShaggy.

Saved 1 byte thanks toArnauld.

Try it online!

Question 43

s=>s.replace(/./g,x=>'⁰¹²³⁴⁵⁶⁷⁸⁹'.indexOf(x)) saves 3 bytes.

Question 44

Save another byte

Question 45

It should be safe to usesearch in place ofindexOf.

Question 46

Vyxal, 7 bytes

C:12%⋏ṅ

Try it Online!

Port of Lynn's answer thanks to steffan.

Question 47

I just commented for clarification that this was allowed before posting it lol, guess I got ninja'd. Sadge, since I already had the answer written up and everything.

Question 48

That being said, you can use theK flag in 2.4.1 to get 6 bytes:Try it Online!

Question 49

According to OP, I guess a list of digits is invalid, so here's a valid 7 bytes:Try it Online!

Question 50

^ This is invalid because list of digits is invalid. You can use lynn's formula though to keep the 7 bytes:C:12%⋏ṅ

Question 51

Pip,9 12 bytes

+3 bytes to handle more stringent rules

+:A_%E#A_MJa

Attempt This Online!

Explanation

After some trial and error, I found a really nice property of these numbers' codepoints:

¹, ², and ³ have codepoints 185, 178, and 179. Mod 8 (or 4), these become 1, 2, and 3.
The other superscript numbers have codepoints equal to the corresponding digit plus 8304. Mod 16 (or 12, or many other options), these become their respective digits.

So all we need to do is take the codepoint of each digit mod 8 if it's 3 digits and mod 16 if it's 4 digits...

          a  First command-line argument        MJ   Map this function to each character, joining the results together:  A_          Codepoint of the character    %         Mod     E        2 to the power of      #       Length of       A_     Codepoint of the character+:           Treat the resulting string as a number (removing leading 0s)

Question 52

Python 3, 53 bytes

from unicodedata import*lambda s:normalize("NFKC",s)

Try it online!

Question 53

ifunicodedata module is not bulitin then changePython 3 toPython 3 + Unicodedata

Question 54

@Fmbalbuena I think it is builtin.

Question 55

Docs.

Question 56

05AB1E,11 8bytes

Ç92%12%J

-3 bytes porting@Arnauld's JavaScript method (thanks@Neil for the heads up).

Add a trailingï (+1 byte) if you want to remove leading 0s..

Try it online orverify all test cases.

Explanation:

Ç         # Convert the (implicit) input to a list of its codepoint-integers          #  e.g. "⁰¹²³⁴⁵⁶⁷⁸⁹" → [8304,185,178,179,8308,8309,8310,8311,8312,8313] 92%      # Modulo-92          #  → [24,1,86,87,28,29,30,31,32,33]    12%   # Modulo-12          #  → [0,1,2,3,4,5,6,7,8,9]       J  # Join the list together          #  → 0123456789        ï # (Optionally) Remove leading 0s by casting to an integer          #  → 123456789          # (after which the result is output implicitly)

Question 57

Apparently a list of digits isn't allowed?

Question 58

@Neil Ah ok.. Added a join after it, thanks for the heads up.

Question 59

Also, everyone seems to be porting @Arnauld's answer which I assume would beÇ92%12%J in this case.

Question 60

Python 3,63 62 bytes

lambda n: int("".join([str("⁰¹²³⁴⁵⁶⁷⁸⁹".index(c))for c in n]))

Thanks @Fmbalbuena!

Question 61

lambda n:int("".join([str("⁰¹²³⁴⁵⁶⁷⁸⁹".index(c))for c in n])) -2 bytes

Question 62

lambda n:int("".join(str("⁰¹²³⁴⁵⁶⁷⁸⁹".index(c))for c in n)) will work, i think

Question 63

Retina 0.8.2, 19 bytes

T`⁰-⁹_¹²³`dd

Try it online! Link includes test cases. Explanation:d is a shorthand for0123456789. As⁰-⁹ expands to⁰ⁱ⁲⁳⁴⁵⁶⁷⁸⁹, and assuming none ofⁱ⁲⁳ will appear in the input, those supserscript digits will get mapped to ASCII digits, while the_¹²³ gets mapped to0123 (the remaining digits ind get ignored)._ is actually a placeholder on the LHS and does nothing except to skip0 on the RHS (on the RHS it causes the character on the LHS to be deleted).

Question 64

Japt `-m`, 7bytes

Use Arnauld's formula so be sure to upvote him.

c %#\%C

Try it

Shaggy 45.1k4 gold badges39 silver badges95 bronze badges · Accepted Answer · 2021-12-13 16:46:44Z

17

\$\begingroup\$

JavaScript, 20 bytes

s=>s.normalize`NFKD`

Try it online!

Share

Improve this answer

answeredDec 13, 2021 at 16:46

Shaggy

45.1k4 gold badges39 silver badges95 bronze badges

\$\endgroup\$

2

7
\$\begingroup\$+1 for finding the builtin.\$\endgroup\$
Neil
– Neil
2021-12-13 19:44:40 +00:00
CommentedDec 13, 2021 at 19:44
\$\begingroup\$+s.normalize… to remove leading zeros\$\endgroup\$
customcommander
– customcommander
2022-09-07 22:14:27 +00:00
CommentedSep 7, 2022 at 22:14

Add a comment |

Movatterモバイル変換

Convert superscript numbers to normal numbers

Introduction

Your Challenge

Test Cases

40 Answers40

JavaScript, 20 bytes

JavaScript (ES6), 43 bytes

Conversion table

Hexagony, side length 4, 37 bytes

Unwrapped code:

Jelly, 7 bytes

R,4553 51 bytes

R,5351 57 bytes /25 bytes with IO as character codes

R, 40 bytes with IO as character codes

Charcoal, 2 bytes

Python 3.8 (pre-release),46 50 bytes

Raku,141011 8 bytes

Raku-p,1519 bytes

C (gcc),83\$\cdots\$60 46 bytes

JavaScript,656261 60 bytes

Vyxal, 7 bytes

Pip,9 12 bytes

Explanation

Python 3, 53 bytes

05AB1E,11 8bytes

Python 3,63 62 bytes

Retina 0.8.2, 19 bytes

Japt-m, 7bytes

C (gcc) with-funsigned-char, 63 bytes

APL (dzaima/APL),16 15 bytes

APOL,46 27 bytes

Explanation

Nibbles,6.5 6 bytes (12 nibbles)

Java, 67 bytes

Husk,10 9 bytes

PHP, 35 bytes

Nim, 63 bytes

Nim, 45 bytes

Turing Machine Code, 99 bytes

Ruby, 40 bytes

Factor, 13 bytes

Lua, 94 bytes

Excel,72 63 bytes

Your Answer

Sign up orlog in

Post as a guest

Linked

Related

Hot Network Questions

Raku,¹⁴¹⁰¹¹ 8 bytes

Raku`-p`,1519 bytes

C (gcc),^{83\$\cdots\$60} 46 bytes

Japt `-m`, 7bytes

C (gcc) with`-funsigned-char`, 63 bytes