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 21:02highloadLLMhighloadLLMScore: 19,021Success
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 21:0318,773628,760,285580,533,00038,982,0002,113,536
2Jun 7, 2026 21:0318,782629,066,277581,077,00038,733,0002,113,536
3Jun 7, 2026 21:0318,924636,029,204585,057,00039,443,0002,113,536
4Jun 7, 2026 21:0318,980635,517,489586,991,00039,377,0002,113,536
5Jun 7, 2026 21:0319,021636,930,279588,497,00039,198,0002,113,536
6Jun 7, 2026 21:0319,063638,246,923589,767,00039,317,0002,113,536
7Jun 7, 2026 21:0319,085638,959,857590,529,00039,305,0002,113,536
8Jun 7, 2026 21:0319,137640,706,416591,620,00039,913,0002,113,536
9Jun 7, 2026 21:0319,195644,308,506594,595,00038,848,0002,113,536