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 listNov 6, 2025 08:55izotoffizotoffScore: 233,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 08:55231,2907,669,943,7927,529,625,000102,953,0002,285,568
2Nov 6, 2025 08:55233,8027,750,772,3757,560,532,000154,928,0002,445,312
3Nov 6, 2025 08:55244,5768,134,365,6097,925,220,000145,783,0002,289,664