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:58highload-churnerhighload-churnerScore: 17,508Success
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:2617,287581,073,960559,455,00011,038,00020,480
2Oct 9, 2026 08:2617,291581,324,240559,487,00011,143,00020,480
3Oct 9, 2026 08:2617,328582,561,994560,854,00010,982,00020,480
4Oct 9, 2026 08:2617,431585,865,567564,426,00010,828,00020,480
5Oct 9, 2026 08:2617,508588,473,383566,755,00011,028,00020,480
6Oct 9, 2026 08:2617,619592,070,375570,538,00010,898,00020,480
7Oct 9, 2026 08:2617,847599,614,134577,876,00011,083,00020,480
8Oct 9, 2026 08:2618,270613,512,634591,540,00011,386,00020,480
9Oct 9, 2026 08:2618,333615,639,688594,134,00010,879,00020,480