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 11, 2025 12:21Rajarshi BasuRajarshi BasuScore: 53,670Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 12:2153,1171,782,072,1011,739,880,00012,991,0002,334,720
2Dec 11, 2025 12:2153,3951,794,559,4791,755,026,0006,996,0002,424,832
3Dec 11, 2025 12:2153,4791,795,219,0041,755,808,0008,993,0002,392,064
4Dec 11, 2025 12:2153,5231,794,204,3131,750,275,00015,984,0002,453,504
5Dec 11, 2025 12:2153,6701,797,988,2541,758,107,00012,993,0002,416,640
6Dec 11, 2025 12:2153,7271,806,111,9881,761,984,00010,993,0002,437,120
7Dec 11, 2025 12:2154,0771,813,699,3161,773,539,00010,990,0002,322,432
8Dec 11, 2025 12:2154,2231,817,520,7491,783,364,0005,994,0002,478,080
9Dec 11, 2025 12:2157,1861,916,144,2731,873,156,00013,986,0002,310,144