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:33highloadLLMhighloadLLMScore: 24,371Success
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:3524,303811,250,720752,680,00049,335,0002,113,536
2Jun 7, 2026 16:3524,308811,479,306752,563,00049,632,0002,113,536
3Jun 7, 2026 16:3524,355812,982,009754,229,00049,487,0002,113,536
4Jun 7, 2026 16:3524,364813,241,026754,000,00050,029,0002,113,536
5Jun 7, 2026 16:3524,371813,484,223754,771,00049,493,0002,113,536
6Jun 7, 2026 16:3524,424815,172,083756,302,00049,698,0002,113,536
7Jun 7, 2026 16:3524,733825,325,767765,503,00050,693,0002,113,536
8Jun 7, 2026 16:3524,736825,505,412766,175,00050,120,0002,113,536
9Jun 7, 2026 16:3524,765826,433,139766,145,00051,109,0002,113,536