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 11, 2026 01:31zielajzielajScore: 3,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 01:312,975121,418,83996,186,0002,003,0002,535,424
2Jan 11, 2026 01:313,003120,609,28897,109,0002,002,0002,535,424
3Jan 11, 2026 01:313,041127,029,79598,348,0002,007,0002,289,664
4Jan 11, 2026 01:313,074126,197,190100,428,0001,004,0002,273,280
5Jan 11, 2026 01:313,088121,451,04999,896,0001,997,0002,420,736
6Jan 11, 2026 01:313,110125,161,164101,636,0001,006,0002,416,640
7Jan 11, 2026 01:313,115127,303,424102,797,00002,412,544
8Jan 11, 2026 01:313,212136,760,732104,005,0002,000,0002,416,640
9Jan 11, 2026 01:313,228132,646,636103,501,0003,014,0002,408,448