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 listJul 12, 2025 17:01Aniruddha DebAniruddha DebScore: 376,443Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2025 17:01374,64112,401,583,96712,261,214,000101,943,0002,510,848
2Jul 12, 2025 17:01376,44312,453,923,55212,319,691,000102,938,0002,310,144
3Jul 12, 2025 17:01382,56812,656,548,35912,502,819,000121,920,0002,363,392