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 22, 2025 16:34Ian MckibbenIan MckibbenScore: 15,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:3415,665548,208,106440,942,00075,990,0002,306,048
2Jun 22, 2025 16:3415,710545,301,735441,502,00076,913,0002,408,448
3Jun 22, 2025 16:3415,714541,208,335438,633,00079,933,0002,428,928
4Jun 22, 2025 16:3415,735542,014,730445,222,00074,037,0002,310,144
5Jun 22, 2025 16:3415,738542,798,795452,439,00066,917,0002,318,336
6Jun 22, 2025 16:3415,744541,775,473442,616,00076,933,0002,527,232
7Jun 22, 2025 16:3415,768550,629,806439,436,00080,896,0002,310,144
8Jun 22, 2025 16:3415,769543,133,788435,491,00084,900,0002,285,568
9Jun 22, 2025 16:3415,787539,115,207456,986,00063,998,0002,400,256