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 19, 2026 15:34Dominique GarmierDominique GarmierScore: 31,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 15:3431,6881,074,980,441993,734,00051,986,0002,351,104
2Mar 19, 2026 15:3431,8061,082,998,769985,621,00063,975,0002,383,872
3Mar 19, 2026 15:3431,9091,082,219,2391,000,034,00052,948,0002,494,464