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 06:19Andrew EpsteinAndrew EpsteinScore: 1,466Success
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 06:221,45143,533,16199,106,0001,182,0002,170,880stderr
2Oct 31, 2026 06:221,45143,530,98698,607,0001,196,0002,170,880stderr
3Oct 31, 2026 06:221,45143,536,91898,955,0001,212,0002,170,880stderr
4Oct 31, 2026 06:221,46043,807,64899,793,0001,184,0002,170,880stderr
5Oct 31, 2026 06:221,46644,005,262100,292,0001,229,0002,170,880stderr
6Oct 31, 2026 06:221,47144,151,066101,020,0001,104,0002,170,880stderr
7Oct 31, 2026 06:221,47844,359,724101,699,0001,112,0002,170,880stderr
8Oct 31, 2026 06:221,48744,635,186102,028,0001,254,0002,170,880stderr
9Oct 31, 2026 06:221,49544,857,257103,182,0001,099,0002,170,880stderr