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 listJul 5, 2023 20:45Radek SzymanskiRadek SzymanskiScore: 250,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2023 20:45248,5208,269,859,3748,201,162,53202,228,224
2Jul 5, 2023 20:45250,5678,334,274,9538,268,708,60902,252,800
3Jul 5, 2023 20:45251,3548,366,490,4408,294,689,31302,289,664