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 listMar 9, 2023 02:27Saken BerdibekovSaken BerdibekovScore: 230,240Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2023 02:27230,1357,662,940,1517,594,456,94802,232,320
2Mar 9, 2023 02:27230,2407,657,302,3787,597,929,39402,289,664
3Mar 9, 2023 02:27232,7037,757,438,0677,679,213,81602,314,240