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 listJun 21, 2025 17:24Ian MckibbenIan MckibbenScore: 426,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 17:24425,34914,076,917,84413,948,558,00087,946,0002,482,176
2Jun 21, 2025 17:24426,49214,115,480,60513,984,297,00089,944,0002,367,488
3Jun 21, 2025 17:24427,34614,141,250,64114,020,481,00081,944,0002,330,624