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 05:23highload-churnerhighload-churnerScore: 9,075Success
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 05:249,022306,779,020257,337,00040,409,00020,480
2Oct 12, 2026 05:249,027306,942,349258,461,00039,454,00020,480
3Oct 12, 2026 05:249,041307,346,593258,828,00039,526,00020,480
4Oct 12, 2026 05:249,053307,732,538259,176,00039,576,00020,480
5Oct 12, 2026 05:249,075308,297,567260,218,00039,260,00020,480
6Oct 12, 2026 05:249,130310,424,500261,681,00039,630,00020,480
7Oct 12, 2026 05:249,161311,402,990263,694,00038,647,00020,480
8Oct 12, 2026 05:249,178311,859,807262,405,00040,489,00020,480
9Oct 12, 2026 05:249,287315,392,285265,894,00040,607,00020,480