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 17, 2026 03:36highload-churnerhighload-churnerScore: 7,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:377,908270,219,093254,956,0006,034,00020,480
2Oct 17, 2026 03:377,911270,271,003255,066,0006,021,00020,480
3Oct 17, 2026 03:377,913271,243,993255,120,0006,041,00020,480
4Oct 17, 2026 03:377,922270,682,133255,385,0006,070,00020,480
5Oct 17, 2026 03:377,952271,815,336256,368,0006,076,00020,480
6Oct 17, 2026 03:377,955272,081,429256,498,0006,027,00020,480
7Oct 17, 2026 03:377,957271,811,483256,487,0006,104,00020,480
8Oct 17, 2026 03:377,967272,079,834256,792,0006,129,00020,480
9Oct 17, 2026 03:378,019274,027,759258,461,0006,176,00020,480