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 listJul 25, 2025 13:28Hayk KarapetyanHayk KarapetyanScore: 281,664Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2025 13:28281,1529,313,708,5969,174,068,000103,932,0002,424,832
2Jul 25, 2025 13:28281,6649,327,603,0289,195,971,00098,945,0002,514,944
3Jul 25, 2025 13:28282,8769,372,567,9449,237,975,00096,936,0002,273,280