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 07:29highload-churnerhighload-churnerScore: 2,705Success
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 07:322,69097,768,84387,617,0001,166,00020,480
2Oct 13, 2026 07:322,69397,904,39487,692,0001,200,00020,480
3Oct 13, 2026 07:322,69397,941,89787,718,0001,164,00020,480
4Oct 13, 2026 07:322,70198,155,46787,913,0001,232,00020,480
5Oct 13, 2026 07:322,70598,221,74288,054,0001,223,00020,480
6Oct 13, 2026 07:322,71598,624,58088,545,0001,066,00020,480
7Oct 13, 2026 07:322,72799,027,99988,814,0001,204,00020,480
8Oct 13, 2026 07:322,73599,280,30889,105,0001,173,00020,480
9Oct 13, 2026 07:322,739100,796,50489,163,0001,234,00020,480