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 9, 2026 20:38Pavel SkripkinPavel SkripkinScore: 86,377Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 20:3885,1442,836,639,5472,799,759,0009,995,0002,510,848
2Jan 9, 2026 20:3886,3772,874,380,1522,840,432,0009,994,0002,281,472
3Jan 9, 2026 20:3893,2203,109,084,9303,066,262,0009,994,0002,355,200