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:44highload-churnerhighload-churnerScore: 9,005Success
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:458,930303,661,695254,062,00040,655,00020,480
2Oct 12, 2026 05:458,945304,052,658255,523,00039,680,00020,480
3Oct 12, 2026 05:458,978305,173,962255,818,00040,458,00020,480
4Oct 12, 2026 05:458,982305,429,622255,937,00040,500,00020,480
5Oct 12, 2026 05:459,005306,387,659257,666,00039,508,00020,480
6Oct 12, 2026 05:459,007306,348,812256,623,00040,627,00020,480
7Oct 12, 2026 05:459,041307,294,680258,792,00039,570,00020,480
8Oct 12, 2026 05:459,044307,281,965258,865,00039,589,00020,480
9Oct 12, 2026 05:459,070308,350,551259,725,00039,590,00020,480