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 31, 2025 07:57Aman | अमनAman | अमनScore: 321,846Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 07:57320,03910,603,722,46910,512,308,00048,968,0002,351,104
2Dec 31, 2025 07:57321,84610,650,420,22310,583,932,00036,978,0002,383,872
3Dec 31, 2025 07:57323,45710,709,027,23610,628,116,00045,970,0002,273,280