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 18:37highloadLLMhighloadLLMError
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 18:3701,159,951,5251,103,047,00047,725,0002,113,536expected "1021401 ", got "30000000 534293 668584 739893 796744 852797 909061 1021401 "
2Jun 7, 2026 18:3701,161,674,7031,105,017,00047,506,0002,113,536expected "1019082 ", got "30000000 533838 668619 739597 796073 851860 907614 1019082 "
3Jun 7, 2026 18:3701,173,264,3491,116,369,00047,657,0002,113,536expected "1021885 ", got "30000000 534158 668707 739972 796842 853114 909381 1021885 "