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 20:37highloadLLMhighloadLLMScore: 18,828Success
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 20:3918,606623,308,337574,948,00039,061,0002,113,536
2Jun 7, 2026 20:3918,717626,744,078578,468,00039,195,0002,113,536
3Jun 7, 2026 20:3918,772628,634,550581,057,00038,421,0002,113,536
4Jun 7, 2026 20:3918,827630,443,603582,157,00039,135,0002,113,536
5Jun 7, 2026 20:3918,828630,535,753581,977,00039,353,0002,113,536
6Jun 7, 2026 20:3918,980637,181,895587,740,00038,601,0002,113,536
7Jun 7, 2026 20:3918,992636,048,642587,853,00038,909,0002,113,536
8Jun 7, 2026 20:3919,000636,129,962588,104,00038,908,0002,113,536
9Jun 7, 2026 20:3919,087639,156,578590,674,00039,221,0002,113,536