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 21, 2026 14:57Dominique GarmierDominique GarmierScore: 78,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 14:5774,7082,493,249,1742,451,386,00013,990,0002,449,408
2Mar 21, 2026 14:5778,5482,622,046,2802,584,088,0007,997,0002,404,352
3Mar 21, 2026 14:5778,7882,630,397,6402,587,995,00011,995,0002,281,472