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,393Success
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:0618,094607,780,572586,131,00011,003,00020,480
2Oct 9, 2026 08:0618,271613,512,194592,332,00010,625,00020,480
3Oct 9, 2026 08:0618,292614,243,117592,835,00010,801,00020,480
4Oct 9, 2026 08:0618,381617,216,076595,851,00010,739,00020,480
5Oct 9, 2026 08:0618,393618,231,823596,351,00010,628,00020,480
6Oct 9, 2026 08:0618,559623,753,590601,689,00010,767,00020,480
7Oct 9, 2026 08:0618,748629,414,046608,128,00010,581,00020,480
8Oct 9, 2026 08:0618,793630,827,883609,341,00010,851,00020,480
9Oct 9, 2026 08:0619,639658,882,345637,220,00010,891,00020,480