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 21, 2025 16:56Ian MckibbenIan MckibbenScore: 490,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 16:56489,03216,177,500,29916,036,118,000101,930,0002,334,720
2Jun 21, 2025 16:56490,04416,202,825,44716,073,517,00097,936,0002,334,720
3Jun 21, 2025 16:56490,21416,215,930,17016,071,132,000105,934,0002,461,696