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:40highloadLLMhighloadLLMScore: 12,618Success
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:4412,552423,332,335345,819,00068,425,0002,113,536
2Jun 8, 2026 04:4412,591424,672,830347,096,00068,418,0002,113,536
3Jun 8, 2026 04:4412,594424,820,003347,071,00068,550,0002,113,536
4Jun 8, 2026 04:4412,614425,449,260346,952,00069,329,0002,113,536
5Jun 8, 2026 04:4412,618425,570,814347,439,00068,959,0002,113,536
6Jun 8, 2026 04:4412,623425,792,659347,941,00068,627,0002,113,536
7Jun 8, 2026 04:4412,626425,811,435346,367,00070,294,0002,113,536
8Jun 8, 2026 04:4412,652426,596,888347,740,00069,805,0002,113,536
9Jun 8, 2026 04:4412,670427,265,308348,247,00069,873,0002,113,536