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 16, 2026 23:13Dominique GarmierDominique GarmierScore: 34,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 23:1334,2531,157,274,0741,121,370,0008,994,0002,371,584
2Mar 16, 2026 23:1334,2791,160,792,7231,122,222,0008,993,0002,273,280
3Mar 16, 2026 23:1334,3401,166,562,5341,126,224,0006,995,0002,387,968