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 22:05highloadLLMhighloadLLMScore: 18,894Success
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 22:0618,664626,165,793577,564,00038,380,0002,117,632
2Jun 7, 2026 22:0618,777628,781,580581,418,00038,251,0002,113,536
3Jun 7, 2026 22:0618,778628,829,780580,891,00038,808,0002,113,536
4Jun 7, 2026 22:0618,785629,111,327581,763,00038,152,0002,113,536
5Jun 7, 2026 22:0618,894632,735,645585,305,00038,229,0002,113,536
6Jun 7, 2026 22:0618,903633,082,699585,559,00038,250,0002,113,536
7Jun 7, 2026 22:0618,916633,347,065585,131,00039,112,0002,113,536
8Jun 7, 2026 22:0619,152641,057,021593,418,00038,600,0002,113,536
9Jun 7, 2026 22:0619,558654,647,278607,077,00038,354,0002,113,536