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 15, 2026 13:00Dominique GarmierDominique GarmierScore: 34,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 13:0034,7861,179,966,7431,142,939,0004,999,0002,338,816
2Mar 15, 2026 13:0034,8381,172,621,1241,140,654,0008,997,0002,482,176
3Mar 15, 2026 13:0035,4331,195,006,0331,162,286,0006,989,0002,273,280