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 04:27Josu San MartinJosu San MartinScore: 32,193Success
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 15:0231,7191,075,586,0381,031,720,00014,995,0002,383,872
2Dec 22, 2025 15:0231,7751,072,706,9231,033,570,00014,993,0002,285,568
3Dec 22, 2025 04:2731,9401,081,637,3991,038,010,00016,000,0002,359,296
4Dec 22, 2025 04:2732,1931,093,518,0941,051,372,00010,993,0002,285,568
5Dec 22, 2025 04:2732,5621,104,697,1391,061,560,00012,994,0002,375,680
6Dec 22, 2025 15:0232,8271,113,568,8181,069,292,00013,990,0002,289,664