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 23, 2025 03:25Ian MckibbenIan MckibbenError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 03:2500000Error: expected "1023697 ", got "15: 2.32316 10: 2.32061 4: 2.3195 6: 2.31884 9: 2.31738 5: 2.31654 14: 2.31651 12: 2.31419 8: 2.31206 11: 2.30968 13: 2.3087 7: 2.28463 3: 2.06498 2: 0.170527 1: 0.002673 16: 0 1023697"stderr