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 23:13highload-churnerhighload-churnerScore: 10,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2026 00:5410,221348,543,348290,236,00047,064,00020,480
2Oct 10, 2026 00:5410,236349,092,670290,517,00047,271,00040,960
3Oct 10, 2026 00:5410,811367,243,021306,597,00050,166,00020,480
4Oct 10, 2026 00:5410,826367,688,718307,490,00049,786,00020,480
5Oct 10, 2026 00:5410,887369,645,008309,116,00050,165,00020,480
6Oct 10, 2026 00:5410,890370,058,310309,725,00049,674,00020,480
7Oct 10, 2026 00:5410,904371,000,990310,071,00049,786,00020,480
8Oct 10, 2026 00:5410,932371,258,095311,633,00049,151,00020,480
9Oct 10, 2026 00:5410,948371,915,701312,062,00049,224,00020,480