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 25, 2025 02:03Ian MckibbenIan MckibbenScore: 15,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 02:0315,064525,669,621413,086,00084,017,0002,490,368
2Jun 25, 2025 02:0315,089528,415,741418,946,00078,989,0002,441,216
3Jun 25, 2025 02:0315,263531,158,719432,726,00070,955,0002,310,144