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 10:31highloadLLMhighloadLLMScore: 15,283Success
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 10:3214,816498,275,729484,902,0004,039,0002,113,536
2Jun 8, 2026 10:3214,822498,876,813485,127,0004,021,0002,113,536
3Jun 8, 2026 10:3214,997504,315,998490,798,0004,131,0002,113,536
4Jun 8, 2026 10:3215,144509,680,841495,700,0004,052,0002,113,536
5Jun 8, 2026 10:3215,283514,298,873500,213,0004,135,0002,113,536
6Jun 8, 2026 10:3215,415518,108,847504,670,0004,040,0002,113,536
7Jun 8, 2026 10:3215,750529,123,740515,625,0004,143,0002,113,536
8Jun 8, 2026 10:3217,370582,601,338569,031,0004,190,0002,113,536
9Jun 8, 2026 10:3217,876600,448,666585,686,0004,243,0002,113,536