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 11:26highload-churnerhighload-churnerScore: 13,860Success
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 11:2713,775464,961,531443,966,00010,625,00020,480
2Oct 9, 2026 11:2713,802465,969,801444,489,00010,982,00020,480
3Oct 9, 2026 11:2713,814466,242,174445,056,00010,806,00020,480
4Oct 9, 2026 11:2713,821466,658,856445,352,00010,751,00020,480
5Oct 9, 2026 11:2713,860467,832,703446,700,00010,712,00020,480
6Oct 9, 2026 11:2713,954470,968,558449,509,00010,983,00020,480
7Oct 9, 2026 11:2714,009472,757,492451,547,00010,757,00020,480
8Oct 9, 2026 11:2714,078475,216,042453,483,00011,123,00020,480
9Oct 9, 2026 11:2714,279481,662,687459,991,00011,238,00020,480