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 23, 2025 06:20Ian MckibbenIan MckibbenScore: 15,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 06:2015,491535,616,657445,312,00065,898,0002,412,544
2Jun 23, 2025 06:2015,527538,358,286443,461,00068,916,0002,318,336
3Jun 23, 2025 06:2015,539533,650,093436,817,00075,968,0002,326,528