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:03highload-churnerhighload-churnerScore: 15,434Success
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:4314,855500,831,525479,370,00010,864,00020,480
2Oct 9, 2026 08:4314,873501,507,926480,135,00010,695,00020,480
3Oct 9, 2026 08:4314,881502,276,011480,264,00010,832,00020,480
4Oct 9, 2026 08:4314,926503,161,902481,656,00010,907,00020,480
5Oct 9, 2026 08:4315,434520,019,838498,562,00010,775,00020,480
6Oct 9, 2026 08:4315,486522,210,988500,305,00010,746,00020,480
7Oct 9, 2026 08:4315,487523,200,699500,111,00010,976,00020,480
8Oct 9, 2026 08:4315,581525,330,479502,763,00011,427,00020,480
9Oct 9, 2026 08:4315,592525,232,232503,721,00010,815,00020,480