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 09:13highload-churnerhighload-churnerScore: 14,361Success
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 09:5414,237480,176,323459,240,00010,596,00020,480
2Oct 9, 2026 09:5414,307482,554,039461,408,00010,747,00020,480
3Oct 9, 2026 09:5414,311482,766,036461,626,00010,663,00020,480
4Oct 9, 2026 09:5414,325483,201,676462,317,00010,439,00020,480
5Oct 9, 2026 09:5414,361484,323,654463,196,00010,744,00020,480
6Oct 9, 2026 09:5414,435486,888,466465,876,00010,502,00020,480
7Oct 9, 2026 09:5414,440486,919,534465,462,00011,070,00020,480
8Oct 9, 2026 09:5414,496488,798,790467,758,00010,626,00020,480
9Oct 9, 2026 09:5414,742496,997,363475,953,00010,538,00020,480