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 10, 2021 16:25Yuriy LyfenkoYuriy LyfenkoScore: 10,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2021 16:259,782293,468,292689,198,61502,654,208
2Jun 10, 2021 16:259,908297,240,917687,230,54102,596,864
3Jun 10, 2021 16:2510,230306,885,755687,716,48502,498,560
4Jun 10, 2021 16:2510,311309,324,258686,026,02802,514,944
5Jun 10, 2021 16:2510,363310,880,161688,289,01602,551,808
6Jun 10, 2021 16:2510,564316,933,322688,054,02902,613,248