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 12, 2026 03:57highload-churnerhighload-churnerScore: 9,530Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 03:589,504322,772,331270,865,00042,799,00024,576
2Oct 12, 2026 03:589,510322,891,835271,616,00042,244,00024,576
3Oct 12, 2026 03:589,513322,963,132271,207,00042,736,00024,576
4Oct 12, 2026 03:589,528323,561,162271,380,00043,075,00024,576
5Oct 12, 2026 03:589,530323,574,408271,516,00042,975,00024,576
6Oct 12, 2026 03:589,537323,624,147271,758,00042,977,00024,576
7Oct 12, 2026 03:589,547324,037,531272,180,00042,881,00024,576
8Oct 12, 2026 03:589,656327,772,128275,850,00042,824,00024,576
9Oct 12, 2026 03:589,828334,194,364281,072,00043,274,00024,576