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 27, 2025 18:47Josu San MartinJosu San MartinScore: 44,730Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 05:4744,5191,495,600,7121,316,312,000152,804,0002,424,832
2Dec 23, 2025 05:4744,5371,501,502,2561,342,907,000126,802,0002,424,832
3Dec 27, 2025 18:4744,6431,495,283,7141,344,383,000128,845,0002,285,568
4Dec 27, 2025 18:4744,7301,505,639,2461,316,305,000159,794,0002,351,104
5Dec 23, 2025 05:4744,7591,502,113,7061,327,251,000149,802,0002,490,368
6Dec 27, 2025 18:4744,8111,507,997,1721,332,978,000145,778,0002,285,568