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 07:51highload-churnerhighload-churnerScore: 18,275Success
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 08:0817,670594,342,021572,732,00010,393,00020,480
2Oct 9, 2026 08:0817,701594,840,707573,800,00010,334,00020,480
3Oct 9, 2026 08:0817,810598,957,003577,447,00010,295,00020,480
4Oct 9, 2026 08:0818,069606,812,071586,006,00010,279,00020,480
5Oct 9, 2026 08:0818,275613,807,754592,733,00010,351,00020,480
6Oct 9, 2026 08:0818,381617,810,902596,302,00010,292,00020,480
7Oct 9, 2026 08:0818,635625,649,373604,776,00010,204,00020,480
8Oct 9, 2026 08:0818,637626,219,661604,731,00010,298,00020,480
9Oct 9, 2026 08:0818,643626,428,100605,105,00010,127,00020,480