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 listJan 4, 2026 17:16zielajzielajScore: 3,149Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 17:163,075127,670,268101,487,00002,535,424
2Jan 4, 2026 17:163,080121,941,01399,635,0002,012,0002,416,640
3Jan 4, 2026 17:163,136131,408,960101,494,0002,009,0002,416,640
4Jan 4, 2026 17:163,149126,422,976100,922,0002,997,0002,420,736
5Jan 4, 2026 17:163,149126,687,222101,924,0001,998,0002,412,544
6Jan 4, 2026 17:163,177133,825,954102,833,0001,996,0002,424,832
7Jan 4, 2026 17:163,192134,266,097103,325,0002,006,0002,269,184
8Jan 4, 2026 17:163,236131,031,098104,805,0001,996,0002,420,736
9Jan 4, 2026 17:163,246126,813,081106,130,0001,001,0002,506,752