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 30, 2025 07:50Rajarshi BasuRajarshi BasuScore: 388,552Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 30, 2025 07:50385,62312,765,547,00512,685,590,00039,973,0002,539,520
2Dec 30, 2025 08:27386,50512,789,379,02212,708,689,00045,969,0002,453,504
3Dec 30, 2025 08:27387,41812,824,989,14412,743,835,00040,970,0002,490,368
4Dec 30, 2025 07:50388,55212,855,039,38612,774,246,00047,970,0002,490,368
5Dec 30, 2025 07:50390,08512,910,154,32812,845,830,00026,980,0002,490,368
6Dec 30, 2025 08:27397,16913,151,843,20813,069,592,00036,973,0002,367,488