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 9, 2026 07:50highload-churnerhighload-churnerScore: 17,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 08:0417,553590,723,554568,748,00010,518,00020,480
2Oct 9, 2026 08:0417,616591,979,997570,844,00010,494,00020,480
3Oct 9, 2026 08:0417,658593,241,086572,192,00010,545,00020,480
4Oct 9, 2026 08:0417,667594,266,777572,469,00010,552,00020,480
5Oct 9, 2026 08:0417,782597,478,117576,203,00010,626,00020,480
6Oct 9, 2026 08:0417,811598,416,325577,131,00010,635,00020,480
7Oct 9, 2026 08:0417,961603,273,984581,796,00010,924,00020,480
8Oct 9, 2026 08:0417,990604,303,032582,921,00010,749,00020,480
9Oct 9, 2026 08:0418,138609,218,713587,819,00010,751,00020,480