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 3, 2024 09:39Yurkov AlekseyYurkov AlekseyScore: 111,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2024 09:39110,7873,728,625,3903,655,975,57102,301,952
2Jan 3, 2024 09:39111,1173,728,102,5143,666,863,42302,306,048
3Jan 3, 2024 09:39111,2383,724,201,8523,670,855,77102,289,664