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 15:19Pavel SkripkinPavel SkripkinScore: 66,546Success
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 15:1965,5332,188,572,8952,153,598,0008,994,0002,281,472
2Jan 9, 2026 15:1966,5462,225,232,4022,187,025,0008,995,0002,523,136
3Jan 9, 2026 15:1967,2252,244,708,6992,210,428,0007,994,0002,277,376