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 12, 2026 06:02highload-churnerhighload-churnerScore: 8,427Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 06:038,394286,238,316233,686,00043,343,00020,480
2Oct 12, 2026 06:038,403286,204,784233,989,00043,337,00020,480
3Oct 12, 2026 06:038,415286,602,085233,363,00044,353,00020,480
4Oct 12, 2026 06:038,417286,786,047233,370,00044,416,00020,480
5Oct 12, 2026 06:038,427287,173,643234,481,00043,613,00020,480
6Oct 12, 2026 06:038,443287,775,510235,150,00043,476,00020,480
7Oct 12, 2026 06:038,451287,946,560234,496,00044,398,00020,480
8Oct 12, 2026 06:038,455288,031,981234,679,00044,344,00020,480
9Oct 12, 2026 06:038,500289,397,007236,170,00044,332,00020,480