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 listJan 10, 2026 13:53Pavel SkripkinPavel SkripkinScore: 74,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 13:5370,3172,347,889,2562,310,466,0009,993,0002,428,928
2Jan 10, 2026 13:5374,1052,470,419,1372,437,470,0007,994,0002,359,296
3Jan 10, 2026 13:5374,7362,496,361,0032,458,280,0007,994,0002,281,472