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 24, 2026 11:25Dominique GarmierDominique GarmierScore: 32,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 11:2532,3601,102,708,0791,061,889,0005,993,0002,297,856
2Mar 24, 2026 11:2532,5341,103,187,3311,068,640,0004,998,0002,301,952
3Mar 24, 2026 11:2532,6151,104,816,0131,070,288,0005,996,0002,371,584