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 listJul 21, 2025 17:09Aniruddha DebAniruddha DebScore: 17,840Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2025 17:0917,595609,858,354530,662,00049,968,0002,342,912
2Jul 21, 2025 17:0917,840614,701,949545,741,00042,979,0002,355,200
3Jul 21, 2025 17:0918,005622,280,175552,235,00041,941,0002,351,104