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 listFeb 23, 2026 16:44Alexander KrivolapovAlexander KrivolapovScore: 39,568Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 16:4439,1841,323,808,3781,281,089,00011,991,0002,355,200
2Feb 23, 2026 16:4439,5681,330,481,3441,295,731,0009,997,0002,289,664
3Feb 23, 2026 16:4440,3131,355,138,6711,318,331,00011,984,0002,416,640