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 listMay 25, 2025 00:42Emanuele BolognesiEmanuele BolognesiScore: 475,269Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 00:42447,53514,804,208,90414,742,674,00025,983,0002,273,280
2May 25, 2025 00:42475,26915,722,118,02015,654,885,00028,983,0002,330,624
3May 25, 2025 00:42476,41515,758,718,77315,700,716,00020,987,0002,289,664