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:57highload-churnerhighload-churnerScore: 18,003Success
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:2417,477588,812,441565,390,00011,374,00020,480
2Oct 9, 2026 08:2417,491587,902,383566,306,00010,897,00020,480
3Oct 9, 2026 08:2417,622592,101,157570,569,00010,984,00020,480
4Oct 9, 2026 08:2417,696594,568,124573,009,00010,960,00020,480
5Oct 9, 2026 08:2418,003604,679,164582,977,00011,142,00020,480
6Oct 9, 2026 08:2418,019616,743,459583,439,00011,191,00020,480
7Oct 9, 2026 08:2418,154609,683,020588,244,00010,857,00020,480
8Oct 9, 2026 08:2418,314630,217,149593,019,00011,344,00020,480
9Oct 9, 2026 08:2418,458629,793,848597,527,00011,588,00020,480