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 13, 2026 13:32highload-churnerhighload-churnerScore: 2,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 13:332,71298,578,69088,335,0001,187,00020,480
2Oct 13, 2026 13:332,71798,583,79988,504,0001,177,00020,480
3Oct 13, 2026 13:332,73099,227,82788,938,0001,165,00020,480
4Oct 13, 2026 13:332,73199,277,14788,958,0001,165,00020,480
5Oct 13, 2026 13:332,73499,212,30489,069,0001,168,00020,480
6Oct 13, 2026 13:332,74099,555,28389,254,0001,184,00020,480
7Oct 13, 2026 13:332,74199,354,05989,274,0001,189,00020,480
8Oct 13, 2026 13:332,766100,285,64490,106,0001,180,00020,480
9Oct 13, 2026 13:332,777100,599,00790,409,0001,235,00020,480