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 23, 2025 16:31Ian MckibbenIan MckibbenScore: 96,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 16:3195,2353,165,036,5873,062,822,00079,943,0002,461,696
2Jun 23, 2025 16:3196,9073,226,189,3613,111,006,00086,916,0002,375,680
3Jun 23, 2025 16:3196,9783,234,850,1093,104,365,00095,918,0002,379,776