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 listMar 29, 2026 08:42Dominique GarmierDominique GarmierScore: 33,337Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 08:4233,2141,129,133,9001,077,047,00019,000,0002,342,912
2Mar 29, 2026 08:4233,3371,136,043,7051,080,129,00019,983,0002,523,136
3Mar 29, 2026 08:4234,7381,175,939,7621,127,378,00018,989,0002,494,464