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 22, 2025 01:51Gerard SmitGerard SmitScore: 166,508Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 01:51164,6055,470,064,9705,407,993,00023,986,0002,424,832
2Jan 22, 2025 01:51166,5085,521,510,2635,467,796,00026,984,0002,310,144
3Jan 22, 2025 01:51173,1515,746,355,9925,691,998,00021,984,0002,457,600