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 12, 2026 04:32highload-churnerhighload-churnerScore: 9,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 04:339,045307,617,264259,025,00039,472,00020,480
2Oct 12, 2026 04:339,086309,057,981259,962,00039,900,00020,480
3Oct 12, 2026 04:339,095309,149,310259,700,00040,455,00020,480
4Oct 12, 2026 04:339,098309,247,987259,700,00040,545,00020,480
5Oct 12, 2026 04:339,116311,461,146260,324,00040,534,00020,480
6Oct 12, 2026 04:339,146310,783,086261,220,00040,602,00020,480
7Oct 12, 2026 04:339,154311,122,512261,563,00040,542,00020,480
8Oct 12, 2026 04:339,164311,519,037261,905,00040,530,00020,480
9Oct 12, 2026 04:339,198312,548,835263,967,00039,579,00020,480