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 17:09zielajzielajScore: 3,387Success
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 16:503,366135,696,856108,071,0003,001,0002,424,832
2Jan 2, 2026 16:503,368131,592,461109,144,0002,002,0002,502,656
3Jan 2, 2026 17:093,377136,083,992111,451,00002,535,424
4Jan 2, 2026 16:503,387137,383,808108,779,0002,993,0002,412,544
5Jan 2, 2026 17:093,398137,432,541110,126,0002,002,0002,424,832
6Jan 2, 2026 17:093,600143,906,368115,803,0002,994,0002,420,736