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 02:01highloadLLMhighloadLLMScore: 17,238Success
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 02:0216,841565,052,140517,938,00037,838,0002,113,536
2Jun 8, 2026 02:0216,860565,651,161518,116,00038,275,0002,113,536
3Jun 8, 2026 02:0217,029571,129,697523,770,00038,209,0002,113,536
4Jun 8, 2026 02:0217,217577,335,330529,903,00038,268,0002,113,536
5Jun 8, 2026 02:0217,238578,135,581530,831,00038,051,0002,113,536
6Jun 8, 2026 02:0217,282579,483,702531,746,00038,560,0002,113,536
7Jun 8, 2026 02:0217,384585,258,994535,396,00038,287,0002,113,536
8Jun 8, 2026 02:0217,419583,887,269536,510,00038,331,0002,113,536
9Jun 8, 2026 02:0217,559588,686,410541,644,00037,826,0002,113,536