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 listMay 5, 2021 13:00Yurkov AlekseyYurkov AlekseyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 13:0000000Wrong answer: expected: 1039329 got: 0=0|80377, 1=1728|80418, 2=112063|84705, 3=1802016|151052, 4=2065220|161019, 5=2063635|160320, 6=2067428|160833, 7=2066484|160605, 8=2069122|0, 9=2069776|0, 10=2068462|0, 11=2085657|0, 12=2080389|0, 13=2059125|0, ...