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 31, 2025 00:07Leonardo Pedrozo AmaralLeonardo Pedrozo AmaralScore: 198,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2025 00:07196,7876,530,098,1856,405,036,00088,944,0002,392,064
2Jul 31, 2025 00:07198,9996,594,886,3726,486,022,00080,937,0002,371,584
3Jul 31, 2025 00:07202,0326,693,845,3106,593,096,00073,956,0002,469,888