Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listSep 8, 2021 12:25Mikhail ShirokovMikhail ShirokovScore: 154,168Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2021 12:25152,1605,079,115,5215,021,263,77602,265,088
2Sep 8, 2021 09:44153,4435,122,145,6505,063,631,26902,285,568
3Sep 8, 2021 09:44153,4845,132,599,1145,064,955,94102,314,240
4Sep 8, 2021 12:25154,1685,158,715,4785,087,540,61902,260,992
5Sep 8, 2021 12:25154,5525,165,889,6875,100,207,24302,220,032
6Sep 8, 2021 09:44155,2205,192,742,0535,122,247,94202,273,280