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:02Yuriy LyfenkoYuriy LyfenkoScore: 13,701Success
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:0213,389401,673,157862,878,27602,547,712
2Jun 7, 2021 16:0213,436403,093,860858,670,59402,396,160
3Jun 7, 2021 16:0213,672410,145,288858,957,43202,551,808
4Jun 7, 2021 16:0213,701411,017,388867,080,08602,547,712
5Jun 7, 2021 16:0213,779413,365,050857,474,60202,560,000
6Jun 7, 2021 16:0214,021420,617,745864,568,31602,580,480