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 17, 2025 18:28Rajarshi BasuRajarshi BasuScore: 15,682Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 17, 2025 18:2514,495506,069,213470,360,0007,989,0002,523,136
2Dec 17, 2025 18:2514,664512,217,663477,909,0005,998,0002,379,776
3Dec 17, 2025 18:2815,063524,578,666489,086,0008,001,0002,297,856
4Dec 17, 2025 18:2815,682544,021,855508,500,0008,991,0002,469,888
5Dec 17, 2025 18:2516,785578,616,505546,920,0006,986,0002,375,680
6Dec 17, 2025 18:2823,427803,679,551769,099,0003,995,0002,342,912