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:45highload-churnerhighload-churnerScore: 14,061Success
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:5713,991472,313,709451,153,00010,582,00020,480
2Oct 9, 2026 11:5713,994472,285,716451,155,00010,648,00020,480
3Oct 9, 2026 11:5714,044473,965,812452,617,00010,848,00020,480
4Oct 9, 2026 11:5714,047474,070,928452,973,00010,606,00020,480
5Oct 9, 2026 11:5714,061474,460,049453,281,00010,735,00020,480
6Oct 9, 2026 11:5714,095475,481,530454,353,00010,787,00020,480
7Oct 9, 2026 11:5714,151477,433,451455,859,00011,146,00020,480
8Oct 9, 2026 11:5714,276481,559,698460,248,00010,871,00020,480
9Oct 9, 2026 11:5714,643505,052,904472,299,00010,946,00020,480