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 08:01highloadLLMhighloadLLMScore: 10,419Success
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 08:0210,375351,790,755307,694,00034,698,0002,113,536
2Jun 8, 2026 08:0210,382352,417,967308,413,00034,225,0002,113,536
3Jun 8, 2026 08:0210,384352,458,762308,554,00034,133,0002,113,536
4Jun 8, 2026 08:0210,385352,065,445308,576,00034,146,0002,113,536
5Jun 8, 2026 08:0210,419353,102,671309,145,00034,692,0002,113,536
6Jun 8, 2026 08:0210,423353,191,275309,916,00034,072,0002,113,536
7Jun 8, 2026 08:0210,426353,445,930308,373,00035,691,0002,113,536
8Jun 8, 2026 08:0210,432353,929,223309,300,00034,974,0002,113,536
9Jun 8, 2026 08:0210,483355,774,198309,797,00036,157,0002,113,536