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:14Yuriy LyfenkoYuriy LyfenkoScore: 11,757Success
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:1411,009330,259,045808,882,40702,547,712
2Jun 7, 2021 16:1411,334340,028,679829,670,15202,306,048
3Jun 7, 2021 16:1411,494344,826,378828,793,07202,428,928
4Jun 7, 2021 16:1411,757352,719,443835,595,22102,543,616
5Jun 7, 2021 16:1411,810354,313,006802,088,62202,551,808
6Jun 7, 2021 16:1412,202366,062,178833,869,86702,568,192