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 23, 2026 16:53Dominique GarmierDominique GarmierScore: 35,352Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 16:5335,2061,187,955,4681,030,930,000130,864,0002,449,408
2Mar 23, 2026 16:5335,3521,196,363,9511,049,752,000116,861,0002,351,104
3Mar 23, 2026 16:5335,7671,204,263,3661,061,471,000118,828,0002,363,392