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 22, 2026 19:42SneedSneedScore: 113,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 19:42112,8903,757,567,5143,678,390,00046,992,0002,478,080
2Feb 22, 2026 19:42113,6163,777,830,7383,695,355,00053,975,0002,498,560
3Feb 22, 2026 19:42115,2833,844,616,3333,747,393,00056,960,0002,289,664