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 listNov 8, 2026 05:47highload-churnerhighload-churnerScore: 2,625Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:482,60295,051,58784,743,0001,145,00020,480
2Nov 8, 2026 05:482,61195,435,81485,054,0001,111,00020,480
3Nov 8, 2026 05:482,61295,406,74785,106,0001,114,00020,480
4Nov 8, 2026 05:482,61495,474,22485,172,0001,113,00020,480
5Nov 8, 2026 05:482,62595,758,57485,480,0001,153,00020,480
6Nov 8, 2026 05:482,62895,934,55885,644,0001,107,00020,480
7Nov 8, 2026 05:482,64396,403,75786,134,0001,106,00020,480
8Nov 8, 2026 05:482,65796,960,49486,571,0001,119,00020,480
9Nov 8, 2026 05:482,66096,924,61386,679,0001,115,00020,480