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 06:33highload-churnerhighload-churnerScore: 2,774Success
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 06:332,74799,664,45489,485,0001,171,00020,480
2Oct 13, 2026 06:332,765100,240,74890,081,0001,169,00020,480
3Oct 13, 2026 06:332,766100,307,65890,122,0001,171,00020,480
4Oct 13, 2026 06:332,767100,166,22090,138,0001,182,00020,480
5Oct 13, 2026 06:332,774100,389,28390,244,0001,304,00020,480
6Oct 13, 2026 06:332,789101,118,95391,020,0001,047,00020,480
7Oct 13, 2026 06:332,799101,245,21391,142,0001,235,00020,480
8Oct 13, 2026 06:332,803101,531,75991,268,0001,237,00020,480
9Oct 13, 2026 06:332,847103,038,74492,815,0001,166,00020,480