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 14:40highload-churnerhighload-churnerScore: 7,994Success
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 14:417,922270,451,370255,416,0006,038,00020,480
2Oct 12, 2026 14:417,950271,185,566256,199,0006,173,00020,480
3Oct 12, 2026 14:417,980273,340,240257,275,0006,083,00020,480
4Oct 12, 2026 14:417,988272,502,507257,498,0006,110,00020,480
5Oct 12, 2026 14:417,994272,812,904257,625,0006,207,00020,480
6Oct 12, 2026 14:417,998273,057,584257,939,0006,017,00020,480
7Oct 12, 2026 14:418,023273,838,407258,654,0006,136,00020,480
8Oct 12, 2026 14:418,131278,166,517262,252,0006,092,00020,480
9Oct 12, 2026 14:418,173278,732,727263,669,0006,044,00020,480