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 listNov 12, 2025 00:42Aniruddha DebAniruddha DebScore: 14,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 00:4214,722508,900,424426,975,00058,858,0002,379,776
2Nov 12, 2025 00:4214,808524,473,788439,793,00048,865,0002,306,048
3Nov 12, 2025 00:4214,848512,772,721429,120,00060,875,0002,297,856