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 22, 2025 16:30Ian MckibbenIan MckibbenScore: 16,237Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:3016,203562,233,854456,735,00077,954,0002,408,448
2Jun 22, 2025 16:3016,211556,543,873464,956,00069,993,0002,404,352
3Jun 22, 2025 16:3016,230561,420,191459,642,00075,940,0002,310,144
4Jun 22, 2025 16:3016,230562,376,933464,649,00070,946,0002,396,160
5Jun 22, 2025 16:3016,237554,906,574457,844,00077,973,0002,404,352
6Jun 22, 2025 16:3016,283567,626,988452,444,00084,895,0002,527,232
7Jun 22, 2025 16:3016,291555,926,210458,664,00078,942,0002,482,176
8Jun 22, 2025 16:3016,292559,968,721458,679,00078,944,0002,314,240
9Jun 22, 2025 16:3016,643570,257,946468,339,00080,885,0002,347,008