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 13, 2026 05:54highload-churnerhighload-churnerScore: 3,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:552,961108,187,92096,452,0001,265,00020,480
2Oct 13, 2026 05:552,968106,923,01996,712,0001,241,00020,480
3Oct 13, 2026 05:552,987107,571,04197,277,0001,308,00020,480
4Oct 13, 2026 05:552,993107,768,27797,556,0001,245,00020,480
5Oct 13, 2026 05:553,000107,942,05097,779,0001,243,00020,480
6Oct 13, 2026 05:553,000108,066,76597,796,0001,228,00020,480
7Oct 13, 2026 05:553,004107,978,14397,736,0001,420,00020,480
8Oct 13, 2026 05:553,012108,336,52498,128,0001,287,00020,480
9Oct 13, 2026 05:553,038109,913,57099,204,0001,068,00020,480