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 5, 2025 11:25CadovvlCadovvlScore: 36,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 11:2536,3841,231,469,5031,187,666,00012,996,0002,465,792
2Dec 5, 2025 11:2536,4121,225,482,4651,185,599,00015,994,0002,383,872
3Dec 5, 2025 11:2536,4191,234,429,4471,187,824,00013,997,0002,433,024
4Dec 5, 2025 11:2536,4391,229,131,0881,191,482,00010,995,0002,301,952
5Dec 5, 2025 11:2536,5101,235,994,0911,191,817,00012,998,0002,330,624
6Dec 5, 2025 11:2536,5311,234,066,4441,193,525,00011,995,0002,469,888
7Dec 5, 2025 11:2536,5951,230,609,4961,192,633,00014,995,0002,457,600
8Dec 5, 2025 11:2536,7151,237,955,6701,198,615,00012,995,0002,392,064
9Dec 5, 2025 11:2536,8311,246,238,8771,205,425,0009,995,0002,461,696