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 listJun 19, 2024 04:42matsuoka-601matsuoka-601Score: 6,082Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2024 04:436,065259,593,258200,138,79002,371,584
2Jun 19, 2024 04:436,066270,224,641200,171,60102,228,224
3Jun 19, 2024 04:426,068260,440,344200,257,91702,228,224
4Jun 19, 2024 04:436,082258,983,370200,718,89702,228,224
5Jun 19, 2024 04:426,086263,783,844200,831,97502,232,320
6Jun 19, 2024 04:426,124258,177,816202,091,18002,228,224