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:03Yuriy LyfenkoYuriy LyfenkoScore: 18,705Success
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:0318,332549,964,919978,382,33202,568,192
2Jun 7, 2021 16:0318,584557,527,745993,468,97202,437,120
3Jun 7, 2021 16:0318,626558,785,251980,636,40402,551,808
4Jun 7, 2021 16:0318,705561,153,133990,711,62002,560,000
5Jun 7, 2021 16:0319,018570,550,668993,962,07802,424,832
6Jun 7, 2021 16:0319,019570,564,667991,319,25202,428,928