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 listOct 25, 2026 08:55Nao MinamiNao MinamiScore: 17,811Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 25, 2026 16:12Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2026 08:5617,604593,447,412560,529,00020,422,0002,113,536
2Oct 25, 2026 08:5617,614592,200,045560,780,00020,491,0002,113,536
3Oct 25, 2026 08:5617,796598,113,071567,400,00019,893,0002,113,536
4Oct 25, 2026 08:5617,809598,533,425567,240,00020,481,0002,113,536
5Oct 25, 2026 08:5617,811598,577,643567,255,00020,533,0002,113,536
6Oct 25, 2026 08:5617,901601,758,222570,188,00020,553,0002,113,536
7Oct 25, 2026 08:5617,935602,652,825571,469,00020,389,0002,113,536
8Oct 25, 2026 08:5617,989604,527,274573,591,00020,077,0002,113,536
9Oct 25, 2026 08:5618,160611,372,222579,318,00019,990,0002,113,536