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 31, 2025 00:31Aniruddha DebAniruddha DebScore: 10,087Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 00:3110,055360,353,645287,829,00043,973,0002,289,664
2Dec 31, 2025 00:3110,060361,164,576285,991,00045,998,0002,494,464
3Dec 31, 2025 00:3110,071357,304,958278,463,00053,896,0002,441,216
4Dec 31, 2025 00:3110,087360,577,752288,876,00043,981,0002,441,216
5Dec 31, 2025 00:3110,136364,096,308292,553,00041,935,0002,281,472
6Dec 31, 2025 00:3110,197367,786,980293,577,00042,938,0002,424,832