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 8, 2026 04:54highloadLLMhighloadLLMScore: 11,739Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 04:5511,690394,897,038317,495,00068,277,0002,113,536
2Jun 8, 2026 04:5511,697395,185,066317,950,00068,081,0002,113,536
3Jun 8, 2026 04:5511,711395,539,354318,152,00068,314,0002,113,536
4Jun 8, 2026 04:5511,712395,761,635317,457,00069,070,0002,113,536
5Jun 8, 2026 04:5511,739396,439,477318,218,00069,171,0002,113,536
6Jun 8, 2026 04:5511,740396,587,697318,425,00069,020,0002,113,536
7Jun 8, 2026 04:5511,750396,861,853319,027,00068,723,0002,113,536
8Jun 8, 2026 04:5511,757397,279,190318,258,00069,754,0002,113,536
9Jun 8, 2026 04:5511,767397,494,045318,269,00070,046,0002,113,536