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 listDec 28, 2024 11:07korsajankorsajanScore: 249,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 11:07245,0848,118,642,8958,000,818,00086,943,0002,359,296
2Dec 28, 2024 11:07249,9008,280,454,5688,158,762,00087,943,0002,318,336
3Dec 28, 2024 11:07250,2798,290,175,1108,169,274,00089,936,0002,289,664