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:56highload-churnerhighload-churnerScore: 16,375Success
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:1915,860534,715,264512,677,00010,734,00020,480
2Oct 9, 2026 08:1916,088541,677,747520,246,00010,666,00020,480
3Oct 9, 2026 08:1916,110542,781,418520,486,00011,161,00020,480
4Oct 9, 2026 08:1916,160544,533,610521,983,00011,310,00020,480
5Oct 9, 2026 08:1916,375551,700,149529,669,00010,723,00020,480
6Oct 9, 2026 08:1916,388551,455,717529,945,00010,874,00020,480
7Oct 9, 2026 08:1916,396551,749,069529,795,00011,284,00020,480
8Oct 9, 2026 08:1916,529556,608,684534,081,00011,389,00020,480
9Oct 9, 2026 08:1916,741563,156,856541,613,00010,857,00020,480