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 22, 2025 14:27Rajarshi BasuRajarshi BasuScore: 15,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 14:2715,727543,042,274501,977,00016,999,0002,400,256
2Dec 22, 2025 14:2715,846546,069,905498,912,00023,995,0002,338,816
3Dec 22, 2025 14:2715,858548,571,126504,341,00018,975,0002,449,408
4Dec 22, 2025 14:2715,893548,113,075505,498,00018,981,0002,310,144
5Dec 22, 2025 14:2715,911551,633,512502,064,00023,002,0002,359,296
6Dec 22, 2025 14:2716,975588,956,872543,201,00016,975,0002,375,680