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:21Yuriy LyfenkoYuriy LyfenkoScore: 11,788Success
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:2111,355340,663,417817,537,77502,564,096
2Jun 7, 2021 16:2111,487344,607,266818,069,68602,404,352
3Jun 7, 2021 16:2111,499344,984,376820,216,49802,560,000
4Jun 7, 2021 16:2111,788353,642,646841,576,35702,564,096
5Jun 7, 2021 16:2111,952358,555,384843,774,95702,433,024
6Jun 7, 2021 16:2112,079362,380,314845,300,14002,428,928