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:57highload-churnerhighload-churnerScore: 2,647Success
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:582,60695,169,53284,853,0001,165,00020,480
2Nov 8, 2026 05:582,61695,568,91785,237,0001,120,00020,480
3Nov 8, 2026 05:582,62495,867,02685,489,0001,115,00020,480
4Nov 8, 2026 05:582,64396,919,44985,897,0001,336,00020,480
5Nov 8, 2026 05:582,64796,635,78986,230,0001,136,00020,480
6Nov 8, 2026 05:582,65596,733,38186,459,0001,159,00020,480
7Nov 8, 2026 05:582,65896,847,83986,700,0001,020,00020,480
8Nov 8, 2026 05:582,68997,932,02387,574,0001,171,00020,480
9Nov 8, 2026 05:582,71498,734,01288,444,0001,131,00020,480