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 listAug 15, 2026 18:26Tomislav TunkovicTomislav TunkovicScore: 1,795Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 18:271,77753,337,613125,293,0001,046,00057,344
2Aug 15, 2026 18:271,78853,669,645127,243,0001,075,00065,536
3Aug 15, 2026 18:271,78953,674,127125,623,0001,040,00065,536
4Aug 15, 2026 18:271,79153,754,089126,433,0001,105,00057,344
5Aug 15, 2026 18:271,79553,879,484126,632,0001,074,00057,344
6Aug 15, 2026 18:271,79553,855,326126,689,0001,094,00057,344
7Aug 15, 2026 18:271,79953,978,882127,125,0001,035,00061,440
8Aug 15, 2026 18:271,81054,315,006127,363,0001,104,00057,344
9Aug 15, 2026 18:271,81254,361,330127,523,0001,126,00065,536