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 05:05highload-churnerhighload-churnerScore: 9,094Success
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 05:069,066308,307,083259,636,00039,559,00020,480
2Oct 12, 2026 05:069,066308,301,799259,609,00039,573,00020,480
3Oct 12, 2026 05:069,081308,627,304259,078,00040,600,00020,480
4Oct 12, 2026 05:069,090309,056,929260,221,00039,770,00020,480
5Oct 12, 2026 05:069,094309,100,262259,579,00040,530,00020,480
6Oct 12, 2026 05:069,131310,245,409261,706,00039,631,00020,480
7Oct 12, 2026 05:069,142310,685,335262,169,00039,517,00020,480
8Oct 12, 2026 05:069,145310,797,962262,229,00039,567,00020,480
9Oct 12, 2026 05:069,233313,774,729264,103,00040,607,00020,480