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 15:59highload-churnerhighload-churnerScore: 14,120Success
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 16:2213,968471,470,567450,162,00010,788,00020,480
2Oct 9, 2026 16:2213,991472,438,268450,800,00010,928,00020,480
3Oct 9, 2026 16:2214,022473,460,846452,123,00010,635,00020,480
4Oct 9, 2026 16:2214,064474,536,013453,320,00010,801,00020,480
5Oct 9, 2026 16:2214,120476,515,121455,257,00010,713,00020,480
6Oct 9, 2026 16:2214,257480,840,838459,234,00011,254,00020,480
7Oct 9, 2026 16:2214,265481,263,006459,551,00011,210,00020,480
8Oct 9, 2026 16:2214,317483,424,523461,644,00010,840,00020,480
9Oct 9, 2026 16:2214,363484,788,504462,830,00011,171,00020,480