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 08:50zielajzielajScore: 3,437Success
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 08:503,415141,074,054109,717,0002,992,0002,396,160
2Jan 2, 2026 08:503,417140,213,794111,774,000997,0002,412,544
3Jan 2, 2026 08:503,421138,875,730110,898,0001,998,0002,416,640
4Jan 2, 2026 08:503,424138,774,098109,977,0002,999,0002,420,736
5Jan 2, 2026 08:503,437137,430,587110,410,0003,011,0002,420,736
6Jan 2, 2026 08:503,443142,439,461113,612,00002,457,600
7Jan 2, 2026 08:503,480138,094,136113,847,000998,0002,416,640
8Jan 2, 2026 08:503,550138,187,566115,148,0002,002,0002,449,408
9Jan 2, 2026 08:503,622147,477,719118,523,0001,004,0002,535,424