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 20:24highloadLLMhighloadLLMScore: 21,170Success
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 20:2521,056704,066,209653,166,00041,686,0002,113,536
2Jun 7, 2026 20:2521,083704,933,886653,668,00042,076,0002,113,536
3Jun 7, 2026 20:2521,096705,385,200655,027,00041,161,0002,113,536
4Jun 7, 2026 20:2521,138706,773,451656,600,00040,959,0002,113,536
5Jun 7, 2026 20:2521,170707,927,959657,428,00041,204,0002,113,536
6Jun 7, 2026 20:2521,177707,968,837656,940,00041,917,0002,113,536
7Jun 7, 2026 20:2521,185708,358,671658,135,00040,973,0002,113,536
8Jun 7, 2026 20:2521,194708,687,283658,139,00041,287,0002,113,536
9Jun 7, 2026 20:2521,219709,513,671659,271,00040,973,0002,113,536