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:02highloadLLMhighloadLLMScore: 25,382Success
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:0325,190840,665,986779,819,00051,474,0002,113,536
2Jun 7, 2026 19:0325,219841,649,585779,480,00052,753,0002,113,536
3Jun 7, 2026 19:0325,303844,541,238781,670,00053,345,0002,113,536
4Jun 7, 2026 19:0325,345846,102,895783,430,00052,973,0002,113,536
5Jun 7, 2026 19:0325,382846,914,337783,951,00053,679,0002,113,536
6Jun 7, 2026 19:0325,453849,370,396786,559,00053,421,0002,113,536
7Jun 7, 2026 19:0325,464849,730,422786,984,00053,332,0002,113,536
8Jun 7, 2026 19:0325,491850,615,728787,586,00053,644,0002,113,536
9Jun 7, 2026 19:0325,534852,330,041788,538,00054,105,0002,113,536