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 listJan 9, 2025 09:55Ian MckibbenIan MckibbenScore: 568,595Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2025 09:55563,39218,631,180,91318,565,961,00025,984,0002,347,008
2Jan 9, 2025 09:55568,59518,802,233,74118,734,660,00028,979,0002,441,216
3Jan 9, 2025 09:55569,28218,824,959,68418,747,336,00038,975,0002,326,528