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 listJun 17, 2025 22:19Aniruddha DebAniruddha DebScore: 26,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 22:1926,587906,267,077869,387,0007,994,0002,379,776
2Jun 17, 2025 22:1926,886911,822,500880,251,0006,994,0002,387,968
3Jun 17, 2025 22:1926,986915,487,512882,532,0007,995,0002,523,136