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 06:35Tomislav TunkovicTomislav TunkovicScore: 2,895Success
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 06:362,84085,213,125209,766,00011,513,0002,162,688
2Aug 15, 2026 06:362,86485,936,618214,833,00011,249,0002,162,688
3Aug 15, 2026 06:362,86986,080,496214,530,00010,738,0002,162,688
4Aug 15, 2026 06:362,87486,233,259216,022,00011,421,0002,162,688
5Aug 15, 2026 06:362,89586,851,236218,816,00011,361,0002,162,688
6Aug 15, 2026 06:362,93387,997,547218,382,00011,220,0002,158,592
7Aug 15, 2026 06:362,94688,380,540217,407,00010,694,0002,158,592
8Aug 15, 2026 06:362,94688,397,036217,972,00012,256,0002,154,496
9Aug 15, 2026 06:362,97089,102,507220,266,00011,243,0002,154,496