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:52highload-churnerhighload-churnerScore: 12,600Success
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 01:3212,416420,340,360398,835,00010,917,00020,480
2Oct 10, 2026 01:3212,498422,917,016401,739,00010,711,00020,480
3Oct 10, 2026 01:3212,501423,119,552401,776,00010,771,00020,480
4Oct 10, 2026 01:3212,510423,368,136401,954,00010,903,00020,480
5Oct 10, 2026 01:3212,600426,374,918404,841,00010,980,00020,480
6Oct 10, 2026 01:3212,659428,245,755406,906,00010,855,00020,480
7Oct 10, 2026 01:3212,684429,028,318407,165,00011,420,00020,480
8Oct 10, 2026 01:3212,710431,304,754408,077,00011,357,00020,480
9Oct 10, 2026 01:3212,813433,328,340411,971,00010,862,00020,480