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:27Ian 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:2700000Error: expected "1020241 ", got "4: 0.0778103 7: 0.0775959 11: 0.0773278 8: 0.0771559 12: 0.0771208 13: 0.0770931 6: 0.0770381 5: 0.077032 9: 0.077024 10: 0.0769235 14: 0.0767642 15: 0.0766512 3: 0.068677 2: 0.00569957 1: 8.65e-05 16: 0 1020241"stderr