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 7, 2026 22:23highloadLLMhighloadLLMScore: 18,956Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 22:2618,667625,256,815576,816,00039,220,0002,113,536
2Jun 7, 2026 22:2618,769628,950,546580,267,00039,125,0002,113,536
3Jun 7, 2026 22:2618,809630,003,751582,348,00038,361,0002,113,536
4Jun 7, 2026 22:2618,946635,879,842586,091,00039,129,0002,113,536
5Jun 7, 2026 22:2618,956634,727,500586,126,00039,450,0002,113,536
6Jun 7, 2026 22:2619,053637,965,223590,097,00038,672,0002,113,536
7Jun 7, 2026 22:2619,060638,069,747589,698,00039,285,0002,113,536
8Jun 7, 2026 22:2619,090639,193,057590,542,00039,448,0002,113,536
9Jun 7, 2026 22:2619,132640,569,968592,483,00038,901,0002,113,536