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:24Ian 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:2400000Error: expected "1026309 ", got "11: 2.32814e+06 7: 2.32606e+06 12: 2.3238e+06 10: 2.32308e+06 5: 2.31697e+06 14: 2.31556e+06 9: 2.31282e+06 6: 2.30871e+06 13: 2.30678e+06 4: 2.30618e+06 8: 2.30478e+06 15: 2.2951e+06 3: 2.06096e+06 2: 168539 1: 2522 16...stderr