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 20, 2026 20:10Pavel SkripkinPavel SkripkinScore: 24,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 20, 2026 20:1023,955808,776,385684,567,000105,933,0002,502,656
2Jan 20, 2026 20:1024,020815,490,475687,709,000104,955,0002,355,200
3Jan 20, 2026 20:1024,833842,061,023704,560,000114,928,0002,449,408