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 12, 2025 14:45Rajarshi BasuRajarshi BasuScore: 11,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 12, 2025 14:4511,406401,803,083366,420,0009,984,0002,506,752
2Dec 12, 2025 14:4511,407401,212,867367,453,0008,986,0002,338,816
3Dec 12, 2025 14:4511,424402,063,281371,003,0006,000,0002,502,656
4Dec 12, 2025 14:4511,436402,917,581367,400,0009,983,0002,494,464
5Dec 12, 2025 14:4511,438405,425,311369,477,0007,988,0002,420,736
6Dec 12, 2025 14:4511,477405,371,252366,745,00011,991,0002,506,752
7Dec 12, 2025 14:4511,497407,951,281373,422,0005,990,0002,510,848
8Dec 12, 2025 14:4511,644408,466,439374,233,00010,006,0002,473,984
9Dec 12, 2025 14:4512,170433,597,967392,610,0008,991,0002,478,080