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 listNov 14, 2025 19:50izotoffizotoffScore: 279,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2025 19:50276,7819,162,487,9979,075,812,00057,960,0002,412,544
2Nov 14, 2025 19:50279,4609,257,935,1269,163,223,00058,969,0002,457,600
3Nov 14, 2025 19:50282,3529,346,329,1449,262,633,00054,968,0002,424,832