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 listJan 2, 2026 23:06zielajzielajScore: 3,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 23:063,137125,089,503103,525,00002,535,424
2Jan 2, 2026 23:063,195134,561,578103,440,0002,008,0002,416,640
3Jan 2, 2026 23:063,206134,123,201103,801,0001,996,0002,420,736
4Jan 2, 2026 23:063,230133,308,580105,575,0001,005,0002,420,736
5Jan 2, 2026 23:063,243126,794,697105,009,0002,000,0002,412,544
6Jan 2, 2026 23:063,254134,217,984104,371,0003,010,0002,416,640
7Jan 2, 2026 23:063,296134,583,461108,767,00002,535,424
8Jan 2, 2026 23:063,308128,348,197106,162,0003,004,0002,412,544
9Jan 2, 2026 23:063,326137,080,046107,775,0001,995,0002,273,280