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 15:21Miriam VellacottMiriam VellacottScore: 134,065Success
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 15:21133,1134,428,480,0364,305,782,00086,955,0002,289,664
2Jan 23, 2025 15:21134,0654,456,245,8544,352,206,00071,953,0002,383,872
3Jan 23, 2025 15:21136,0374,523,637,8764,389,284,00099,938,0002,338,816