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 listSep 24, 2026 19:09Kevin HeaveyKevin HeaveyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 19:0903,925,255,3853,875,681,00040,749,00020,480Exit with code 3: 300271096 30000000 1021717 852936 168781 77 0 0 0 L 0 2461 170589 2065651 2314954 2304614 2327273 2311551 2311135 2306301 2315809 2316651 2323137 2298146 2313379 2318349 0 0 M 15564 15864 15703 15727 15805 15642 15644 911768stderr