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 listFeb 2, 2025 07:05korsajankorsajanScore: 106,704Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2025 07:05106,0913,529,674,7773,432,045,00068,960,0002,310,144
2Feb 2, 2025 07:05106,7043,548,697,3313,468,258,00052,958,0002,318,336
3Feb 2, 2025 07:05107,9873,591,910,8343,527,584,00035,975,0002,437,120