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:55Tomislav TunkovicTomislav TunkovicScore: 1,729Success
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:571,71951,581,775122,922,0003,025,00069,632
2Aug 15, 2026 18:571,72351,705,763125,486,0001,073,00069,632
3Aug 15, 2026 18:571,72851,860,019126,153,0001,073,00069,632
4Aug 15, 2026 18:571,72951,893,603125,844,0001,004,00069,632
5Aug 15, 2026 18:571,72951,871,752124,748,0002,186,00069,632
6Aug 15, 2026 18:571,73251,967,891126,354,0001,064,00069,632
7Aug 15, 2026 18:571,73452,029,391126,256,0001,129,00069,632
8Aug 15, 2026 18:571,73852,154,519125,369,0002,154,00069,632
9Aug 15, 2026 18:571,74552,354,136125,677,0002,997,00069,632