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 12:57Pavel SkripkinPavel SkripkinScore: 70,511Success
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 12:5770,4122,353,728,9492,313,617,0009,994,0002,281,472
2Jan 10, 2026 12:5770,5112,352,592,7052,318,872,0007,996,0002,514,944
3Jan 10, 2026 12:5770,7272,360,620,0232,325,011,0008,996,0002,449,408