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 11, 2025 09:51tumdumtumdumScore: 72,726Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2025 09:5172,5522,428,507,1432,334,221,00059,979,0002,285,568
2Jun 11, 2025 09:5172,7262,422,760,9052,340,969,00058,974,0002,285,568
3Jun 11, 2025 09:5173,8122,458,128,1482,372,836,00062,969,0002,412,544