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 17:28highloadLLMhighloadLLMScore: 26,033Success
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 17:2925,867862,920,673809,998,00043,617,0002,113,536
2Jun 7, 2026 17:2925,887863,509,473810,610,00043,679,0002,113,536
3Jun 7, 2026 17:2925,939865,220,470811,926,00044,078,0002,113,536
4Jun 7, 2026 17:2925,966866,110,788812,354,00044,525,0002,113,536
5Jun 7, 2026 17:2926,033868,392,238814,292,00044,825,0002,113,536
6Jun 7, 2026 17:2926,044868,745,947815,732,00043,730,0002,113,536
7Jun 7, 2026 17:2926,050868,826,337815,496,00044,176,0002,113,536
8Jun 7, 2026 17:2926,069869,800,123815,661,00044,642,0002,113,536
9Jun 7, 2026 17:2926,249875,384,186821,107,00045,117,0002,113,536