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 listJun 7, 2021 16:52Yurkov AlekseyYurkov AlekseyScore: 121,582Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2021 16:52118,5273,555,813,3978,415,667,06802,457,600
2Jun 7, 2021 16:52118,6233,558,702,2378,440,478,10002,502,656
3Jun 7, 2021 16:52120,4263,612,781,4378,574,954,20402,482,176
4Jun 7, 2021 16:52121,5823,647,453,4218,659,048,96302,498,560
5Jun 7, 2021 16:52124,7853,743,538,5288,975,859,63302,596,864
6Jun 7, 2021 16:52126,4763,794,289,8419,027,335,05302,301,952