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 07:57highload-churnerhighload-churnerScore: 15,684Success
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 08:2114,900502,966,498481,034,00010,697,00020,480
2Oct 9, 2026 08:2115,020506,145,217485,086,00010,576,00020,480
3Oct 9, 2026 08:2115,149511,161,317488,599,00011,346,00020,480
4Oct 9, 2026 08:2115,613525,846,978504,330,00010,902,00020,480
5Oct 9, 2026 08:2115,684528,257,342506,796,00010,800,00020,480
6Oct 9, 2026 08:2115,685528,244,458506,718,00010,893,00020,480
7Oct 9, 2026 08:2115,929536,301,173514,193,00011,492,00020,480
8Oct 9, 2026 08:2115,979537,938,778516,042,00011,267,00020,480
9Oct 9, 2026 08:2116,054540,370,516518,873,00010,938,00020,480