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 08:13highload-churnerhighload-churnerScore: 15,958Success
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 09:0415,838533,126,265512,081,00010,592,00020,480
2Oct 9, 2026 09:0415,878534,462,323513,391,00010,610,00020,480
3Oct 9, 2026 09:0415,907535,306,260514,395,00010,541,00020,480
4Oct 9, 2026 09:0415,939536,520,467515,425,00010,586,00020,480
5Oct 9, 2026 09:0415,958537,426,948516,026,00010,619,00020,480
6Oct 9, 2026 09:0416,028539,400,049518,408,00010,538,00020,480
7Oct 9, 2026 09:0416,077540,992,821519,949,00010,595,00020,480
8Oct 9, 2026 09:0416,135542,969,823521,798,00010,681,00020,480
9Oct 9, 2026 09:0416,230546,047,177525,039,00010,567,00020,480