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 16:38highloadLLMhighloadLLMScore: 24,433Success
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 16:3924,250809,547,590750,517,00049,734,0002,113,536
2Jun 7, 2026 16:3924,296813,933,359752,750,00049,040,0002,113,536
3Jun 7, 2026 16:3924,355813,023,072753,993,00049,730,0002,113,536
4Jun 7, 2026 16:3924,420815,117,686755,973,00049,900,0002,113,536
5Jun 7, 2026 16:3924,433815,582,557756,729,00049,570,0002,113,536
6Jun 7, 2026 16:3924,479817,028,250757,183,00050,647,0002,113,536
7Jun 7, 2026 16:3924,511818,062,978758,904,00049,974,0002,113,536
8Jun 7, 2026 16:3924,643822,491,855762,066,00051,156,0002,113,536
9Jun 7, 2026 16:3924,644822,375,165762,953,00050,319,0002,113,536