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 15, 2026 11:41Dominique GarmierDominique GarmierScore: 37,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 11:4137,5341,268,484,4131,223,611,00014,995,0002,318,336
2Mar 15, 2026 11:4137,5381,268,154,9131,228,774,0009,990,0002,478,080
3Mar 15, 2026 11:4137,6541,274,547,5771,230,581,00011,995,0002,273,280