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 8, 2026 16:53anboto1anboto1Score: 5,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 16:555,268183,020,529164,626,0009,245,0002,117,632
2Jun 8, 2026 16:555,271183,204,479164,824,0009,144,0002,117,632
3Jun 8, 2026 16:555,277183,435,369164,912,0009,261,0002,117,632
4Jun 8, 2026 16:555,279183,490,376164,909,0009,312,0002,117,632
5Jun 8, 2026 16:555,297184,102,756165,667,0009,166,0002,117,632
6Jun 8, 2026 16:555,308184,519,808165,880,0009,295,0002,117,632
7Jun 8, 2026 16:555,322186,487,117166,303,0009,346,0002,117,632
8Jun 8, 2026 16:555,358186,045,855167,609,0009,233,0002,117,632
9Jun 8, 2026 16:555,358186,072,823167,422,0009,424,0002,117,632