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 listMar 2, 2026 20:29Alexander KrivolapovAlexander KrivolapovScore: 69,928Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 20:2969,8882,337,753,5232,292,335,00013,983,0002,277,376
2Mar 2, 2026 20:2969,9282,334,863,5342,296,649,00010,988,0002,441,216
3Mar 2, 2026 20:2969,9482,335,097,4112,299,296,0008,993,0002,527,232