What's my PPCG ID?

Code Golf Asked by musicman523 on December 3, 2020


Given the name of a PPCG member, output their PPCG ID number. If the user does not exist, you may report an error or return any non-positive number. If there are multiple members with this name, you may choose to output only one ID or all of them.

Test Cases

"musicman523" -> 69054
"Dennis" -> 12012
"xnor" -> 20260
"Leaky Nun" -> 48934
"fəˈnɛtɪk" -> 64505
"Jörg Hülsermann" -> 59107
"Community" -> -1
"Any user that does not exist" -> 0
"Alex" -> 69198 (this is one possible result)
"Leaky N" -> 0
"Jorge" -> 3716

8 Answers

APL (Dyalog Unicode), 169 bytes

{a≡1⊃y.display_name:y.user_id ⋄ 0}1

This took forever to figure out, lol.

Thanks to @Adám for saving me a lot of time, and a lot of bytes on the HTTP request.


a←⍞                                 ⍝ Store string input
y←        ('s+'⎕R'%20')a          ⍝ Convert spaces to '%20' for query
                                    ⍝ Get and parse JSON from API call using ⎕SE (session namespace)
 a≡⊃y.display_name                  ⍝ Is the input equal to the unwrapped user id? 
                                    ⍝ (display name comes as an array of strings)
{                  :y.user_id ⋄ 0}  ⍝ If so, print the user id
                                    ⍝ Else print zero
                                    ⍝ Call function with placeholder arg 1

Answered by Razetime on December 3, 2020

JavaScript, 128 119 bytes

-9 bytes thanks to Rogem.


Answered by Oliver on December 3, 2020

JavaScript (ES6) + HTML, 154 152 151 202 179 161 145 bytes

Sacrificed a few bytes to handle special characters.

Needs to be run under the domain. Returns a Promise containing the ID or Throws an error in the Promise if the username can't be found.


<a id=o

Note: This solution was developed independently of Uriel's and its comments; if Uriel decides to use the find method, I'm happy to roll back to my longer, recursive version.

Answered by Shaggy on December 3, 2020

Stack Exchange Data Explorer, 56 54 53 51 46 bytes

-1 byte thanks to Hyper Neutrino. -5 bytes thanks to Giacomo Garabello.


Try it online!

Not sure if this is completely valid but... Input must be surrounded in single quotes '.

Also, I still don't get why SQL programmers like to shout but it's apparently good practise so... SELECT EVERYTHING FROM EVERYTHING WHERE EVERYTHING LIKE EVERYTHING!




                                           --S  -- DECLARE AN INPUT PARAMETER NAMED S
SELECT                                          -- FIND...
       ID                                       -- ID OF THE USERS...
          FROM USERS                            -- IN THE TABLE USERS...
                     WHERE                      -- THAT SATISFIES THE CONDITION...
                          ##S##=DISPLAYNAME     -- S EQUALS THE USERS' DISPLAY NAME

Answered by totallyhuman on December 3, 2020

JavaScript, 155 149 142 135 bytes


<input onchange="f(this.value).then(console.log)"><br>Fill input and press Enter

Answered by Uriel on December 3, 2020

Python 2 + requests, 173 bytes

lambda s:[i['user_id']for i in get(''%utils.quote(s)).json()['items']if i['display_name']==s]
from requests import*

Sample run

>>> f=
... lambda s:[i['user_id']for i in get(''%utils.quote(s)).json()['items']if i['display_name']==s]
>>> from requests import*
>>> tests = ['musicman523', 'Dennis', 'xnor', 'Leaky Nun', 'Community', 'Any user that does not exist', 'Alex', 'Leaky N', 'Jorge']
>>> for i in tests: print '%-30r -> %s'%(i, f(i))
'musicman523'                  -> [69054]
'Dennis'                       -> [12012, 13891, 14912, 24937]
'xnor'                         -> [20260]
'Leaky Nun'                    -> [48934]
'Community'                    -> [-1]
'Any user that does not exist' -> []
'Alex'                         -> [21536, 69198, 11192]
'Leaky N'                      -> []
'Jorge'                        -> [3716]

Fun fact: the result is sorted by reputation, highest first.

Answered by totallyhuman on December 3, 2020

Python 2 + requests, 187 bytes

from requests import*
def f(x):t=get(""+utils.quote(x)+"&site=codegolf").json()["items"];print[k['user_id']for k in t if k['display_name']==x][0]

Returns the user ID if a single user exists, the first user which matches the requirements if more exist, and reports an error otherwise.

Answered by Mr. Xcoder on December 3, 2020

Python 3 + requests, 196 bytes

Thanks @Wondercricket for -6 bytes!

from requests import*
x=lambda s:all([print(a['user_id'])if s==a['display_name']else''for a in get(''%utils.quote(s)).json()['items']])and d

Uses Stack Exchange API. Fixed the Leaky N and Jorge errors.

If there are multiple users with the same name, it prints all of them, which is allowed.

Answered by Oliver Ni on December 3, 2020

Add your own answers!

Related Questions

“Hello, World!”

880  Asked on November 21, 2021


Automate Saving the World

20  Asked on November 21, 2021


Rotate every 2×2 block in a matrix

4  Asked on November 21, 2021


Showcase of Languages

238  Asked on November 19, 2021


Saddle points in a matrix

5  Asked on November 19, 2021 by ngn


Trilaterate your position

4  Asked on November 17, 2021 by denker


Simplest Tiling of the Floor

5  Asked on November 15, 2021 by randomra


Is magic possible?

2  Asked on November 8, 2021


We had a question once which only failed on Sundays

52  Asked on November 8, 2021 by manny-queen


Cleaning up decimal numbers

16  Asked on November 8, 2021


Calculate average characters of string

42  Asked on November 5, 2021 by hannes-karppila


Print a tongue twister!

33  Asked on October 27, 2021 by lebster


Are they collinear?

19  Asked on October 27, 2021 by mukundan314


Find the perfect square!

31  Asked on October 27, 2021


Music with pi and e

7  Asked on October 27, 2021


Solve a 2xN Maze

20  Asked on October 27, 2021


Laguerre Polynomials

16  Asked on October 27, 2021 by golf69


Create a Boolean Calculator

21  Asked on October 27, 2021


Ask a Question

Get help from others!

© 2022 All rights reserved. Sites we Love: PCI Database, MenuIva, UKBizDB, Menu Kuliner, Sharing RPP, SolveDir