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:48highloadLLMhighloadLLMScore: 25,841Success
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:4925,553852,515,001796,134,00047,125,0002,113,536
2Jun 7, 2026 17:4925,713857,752,951801,524,00047,028,0002,113,536
3Jun 7, 2026 17:4925,780859,956,641803,373,00047,369,0002,113,536
4Jun 7, 2026 17:4925,840861,898,291805,508,00047,235,0002,113,536
5Jun 7, 2026 17:4925,841861,883,304805,282,00047,501,0002,113,536
6Jun 7, 2026 17:4925,858862,463,697805,160,00048,164,0002,113,536
7Jun 7, 2026 17:4925,893863,544,569805,582,00048,902,0002,113,536
8Jun 7, 2026 17:4925,931864,906,113806,837,00048,895,0002,113,536
9Jun 7, 2026 17:4925,960865,812,770808,423,00048,273,0002,113,536