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 11, 2025 09:47tumdumtumdumScore: 72,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2025 09:4772,0982,408,246,2832,331,243,00047,984,0002,408,448
2Jun 11, 2025 09:4772,2812,417,070,6862,308,297,00076,976,0002,338,816
3Jun 11, 2025 09:4772,6552,434,345,8512,325,646,00071,958,0002,338,816