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 listNov 10, 2026 17:38SabadonSabadonScore: 24,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2026 17:4223,973800,244,247786,809,0004,304,0002,113,536
2Nov 10, 2026 17:4223,975803,904,831786,675,0004,504,0002,113,536
3Nov 10, 2026 17:4224,001801,200,046787,544,0004,512,0002,113,536
4Nov 10, 2026 17:4224,380813,676,778800,110,0004,449,0002,113,536
5Nov 10, 2026 17:4224,411814,548,556801,100,0004,479,0002,113,536
6Nov 10, 2026 17:4224,432815,351,387801,814,0004,471,0002,113,536
7Nov 10, 2026 17:4224,964832,838,864819,360,0004,482,0002,113,536
8Nov 10, 2026 17:4224,966832,917,100819,358,0004,546,0002,113,536
9Nov 10, 2026 17:4224,981833,433,976819,811,0004,582,0002,113,536