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 listDec 11, 2025 15:50Rajarshi BasuRajarshi BasuScore: 30,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:5030,0801,021,079,005975,656,00016,994,0002,347,008
2Dec 11, 2025 15:5030,1661,023,014,517977,484,00017,990,0002,486,272
3Dec 11, 2025 15:5032,9961,115,989,8221,068,897,00019,960,0002,416,640