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 listOct 30, 2026 02:09Andrew EpsteinAndrew EpsteinScore: 3,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2026 02:193,059111,924,34998,750,0002,210,0002,113,536
2Oct 30, 2026 02:193,061112,050,32698,810,0002,208,0002,113,536
3Oct 30, 2026 02:193,096113,179,47999,925,0002,245,0002,113,536
4Oct 30, 2026 02:193,103113,346,324100,172,0002,232,0002,113,536
5Oct 30, 2026 02:193,104114,151,372100,384,0002,061,0002,113,536
6Oct 30, 2026 02:193,126114,609,852101,139,0002,035,0002,113,536
7Oct 30, 2026 02:193,126114,126,981100,914,0002,245,0002,113,536
8Oct 30, 2026 02:193,260119,216,843105,397,0002,195,0002,113,536
9Oct 30, 2026 02:193,343121,405,072108,076,0002,270,0002,113,536