Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 31, 2026 02:37Andrew EpsteinAndrew EpsteinScore: 1,558Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 02:411,52245,686,646100,929,0001,032,0002,170,880
2Oct 31, 2026 02:411,52345,701,271101,882,0001,050,0002,170,880
3Oct 31, 2026 02:411,53446,036,750102,192,0002,023,0002,162,688
4Oct 31, 2026 02:411,54646,397,263102,345,0002,059,0002,162,688
5Oct 31, 2026 02:411,55846,769,441105,221,0002,050,0002,162,688
6Oct 31, 2026 02:411,56446,925,595103,571,0001,041,0002,170,880
7Oct 31, 2026 02:411,57947,383,343106,704,0001,016,0002,170,880
8Oct 31, 2026 02:411,58647,608,882104,123,0001,053,0002,170,880
9Oct 31, 2026 02:411,59447,834,060108,343,0001,017,0002,162,688