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:11highload-churnerhighload-churnerScore: 13,920Success
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 15:2713,830466,845,956445,482,00010,926,00020,480
2Oct 9, 2026 15:2713,834467,075,016445,601,00010,949,00020,480
3Oct 9, 2026 15:2713,849467,750,244446,252,00010,796,00020,480
4Oct 9, 2026 15:2713,877468,432,492447,274,00010,689,00020,480
5Oct 9, 2026 15:2713,920469,735,173448,584,00010,794,00020,480
6Oct 9, 2026 15:2713,941470,511,291449,466,00010,596,00020,480
7Oct 9, 2026 15:2713,974471,555,787449,971,00011,175,00020,480
8Oct 9, 2026 15:2714,000472,526,395451,327,00010,698,00020,480
9Oct 9, 2026 15:2714,059474,629,120453,340,00010,638,00020,480