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 18:09highload-churnerhighload-churnerScore: 13,779Success
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 18:1113,530457,124,373435,857,00010,651,00020,480
2Oct 9, 2026 18:1113,603459,287,989438,320,00010,590,00020,480
3Oct 9, 2026 18:1113,618461,655,365438,886,00010,540,00020,480
4Oct 9, 2026 18:1113,762464,578,653443,424,00010,739,00020,480
5Oct 9, 2026 18:1113,779465,121,852444,038,00010,676,00020,480
6Oct 9, 2026 18:1113,839467,226,943445,330,00011,360,00020,480
7Oct 9, 2026 18:1113,839467,213,527445,557,00011,141,00020,480
8Oct 9, 2026 18:1113,845467,517,536446,281,00010,621,00020,480
9Oct 9, 2026 18:1114,130476,756,669455,613,00010,684,00020,480