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 19:22highloadLLMhighloadLLMScore: 23,739Success
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 19:2323,567786,970,755725,236,00052,506,0002,113,536
2Jun 7, 2026 19:2323,635789,178,707727,312,00052,646,0002,113,536
3Jun 7, 2026 19:2323,639789,353,806727,432,00052,659,0002,113,536
4Jun 7, 2026 19:2323,686790,860,120728,466,00053,182,0002,113,536
5Jun 7, 2026 19:2323,739792,620,252730,230,00053,187,0002,113,536
6Jun 7, 2026 19:2323,748792,931,080730,550,00053,161,0002,113,536
7Jun 7, 2026 19:2323,856796,380,977733,926,00053,326,0002,113,536
8Jun 7, 2026 19:2323,859796,511,769733,613,00053,746,0002,113,536
9Jun 7, 2026 19:2323,876797,174,782735,741,00052,198,0002,113,536