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 06:11highload-churnerhighload-churnerScore: 8,412Success
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 06:128,369285,307,159231,822,00044,377,00020,480
2Oct 12, 2026 06:128,370285,247,526231,958,00044,259,00020,480
3Oct 12, 2026 06:128,373285,426,467231,978,00044,350,00020,480
4Oct 12, 2026 06:128,405286,978,791233,861,00043,526,00020,480
5Oct 12, 2026 06:128,412286,798,374233,995,00043,618,00020,480
6Oct 12, 2026 06:128,423286,936,892234,447,00043,533,00020,480
7Oct 12, 2026 06:128,424286,918,812233,618,00044,387,00020,480
8Oct 12, 2026 06:128,472288,482,804235,288,00044,301,00020,480
9Oct 12, 2026 06:128,610293,451,826241,682,00042,453,00020,480