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:41Aniruddha DebAniruddha DebScore: 9,588Success
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:419,497337,429,513262,505,00050,904,0002,371,584
2Dec 31, 2025 00:419,528339,889,327265,524,00048,912,0002,482,176
3Dec 31, 2025 00:419,569342,391,739271,810,00043,969,0002,461,696
4Dec 31, 2025 00:419,577343,262,997266,031,00050,005,0002,289,664
5Dec 31, 2025 00:419,588342,796,390273,471,00042,917,0002,281,472
6Dec 31, 2025 00:419,594341,788,227264,661,00051,933,0002,449,408
7Dec 31, 2025 00:419,609346,357,189265,253,00051,854,0002,457,600
8Dec 31, 2025 00:419,628343,733,013280,749,00036,966,0002,449,408
9Dec 31, 2025 00:419,653348,145,219264,619,00053,922,0002,453,504