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 18:16Rajarshi BasuRajarshi BasuScore: 21,428Success
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 18:1621,207729,434,651682,825,00016,995,0002,486,272
2Dec 11, 2025 18:1621,266726,777,192684,789,00016,994,0002,289,664
3Dec 11, 2025 18:1621,315733,374,785686,405,00016,985,0002,392,064
4Dec 11, 2025 18:1621,391733,445,942689,916,00015,998,0002,412,544
5Dec 11, 2025 18:1621,428735,773,463685,110,00022,003,0002,326,528
6Dec 11, 2025 18:1621,475736,084,491688,673,00019,990,0002,355,200
7Dec 11, 2025 18:1621,580743,083,990692,156,00019,975,0002,310,144
8Dec 11, 2025 18:1621,845749,816,274708,901,00011,981,0002,506,752
9Dec 11, 2025 18:1623,081792,586,191746,693,00014,973,0002,506,752