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 20:08Rajarshi BasuRajarshi BasuScore: 14,448Success
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 20:0814,346501,473,529454,428,00018,976,0002,281,472
2Dec 11, 2025 20:0814,349496,775,754451,543,00021,977,0002,527,232
3Dec 11, 2025 20:0814,374503,200,032456,373,00017,975,0002,351,104
4Dec 11, 2025 20:0814,412503,893,823456,616,00018,984,0002,461,696
5Dec 11, 2025 20:0814,448500,560,010456,806,00019,991,0002,351,104
6Dec 11, 2025 20:0814,480507,513,385457,853,00019,993,0002,400,256
7Dec 11, 2025 20:0814,565503,920,137459,661,00020,984,0002,473,984
8Dec 11, 2025 20:0814,578507,650,834463,105,00017,965,0002,412,544
9Dec 11, 2025 20:0814,606511,175,751462,001,00020,000,0002,400,256