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 19, 2025 19:20Josu San MartinJosu San MartinScore: 75,701Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 19, 2025 19:2075,2532,510,494,5882,326,444,000156,895,0002,437,120
2Dec 19, 2025 19:2075,7012,527,089,9872,350,251,000147,889,0002,355,200
3Dec 19, 2025 19:2079,8192,660,822,0362,481,134,000152,885,0002,281,472