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 listJun 8, 2026 13:29highloadLLMhighloadLLMScore: 8,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 13:308,665295,313,229257,816,00028,144,0002,117,632
2Jun 8, 2026 13:308,679295,700,826258,679,00027,739,0002,117,632
3Jun 8, 2026 13:308,688296,402,139259,038,00027,670,0002,117,632
4Jun 8, 2026 13:308,707297,063,028259,644,00027,697,0002,117,632
5Jun 8, 2026 13:308,707297,146,576258,339,00029,013,0002,117,632
6Jun 8, 2026 13:308,726297,273,354259,674,00028,293,0002,117,632
7Jun 8, 2026 13:308,751298,211,343261,144,00027,665,0002,117,632
8Jun 8, 2026 13:308,771299,051,636261,074,00028,397,0002,117,632
9Jun 8, 2026 13:308,773299,093,261260,615,00028,914,0002,117,632