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 14:09Pavel SkripkinPavel SkripkinScore: 68,618Success
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 14:0965,8852,204,923,6072,169,204,0004,998,0002,281,472
2Jan 10, 2026 14:0968,6182,299,989,1322,259,405,0004,996,0002,514,944
3Jan 10, 2026 14:0969,2172,316,153,5692,280,156,0003,996,0002,281,472