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 listFeb 3, 2026 22:13olliecrowolliecrowScore: 26,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2026 22:1326,505903,090,168856,661,00017,992,0002,269,184
2Feb 3, 2026 22:1326,549901,444,249859,129,00017,002,0002,342,912
3Feb 3, 2026 22:1326,662900,893,499862,856,00016,997,0002,273,280