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:11Aniruddha DebAniruddha DebScore: 30,694Success
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:1130,6661,040,690,3411,006,992,0004,999,0002,396,160
2Jun 17, 2025 22:1130,6941,038,513,8561,009,898,0002,999,0002,322,432
3Jun 17, 2025 22:1132,6441,097,986,3691,069,265,0007,994,0002,392,064