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 6, 2021 18:19Yuriy LyfenkoYuriy LyfenkoScore: 50,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2021 18:1950,4281,512,825,425978,155,05002,551,808
2Jun 6, 2021 18:1950,4461,513,393,357974,744,54702,428,928
3Jun 6, 2021 18:1950,5891,517,660,966951,925,96002,433,024
4Jun 6, 2021 18:1950,6581,519,726,382975,815,17002,551,808
5Jun 6, 2021 18:1950,6801,520,403,045947,112,15802,416,640
6Jun 6, 2021 18:1950,7171,521,515,871975,147,22202,416,640
7Jun 6, 2021 18:1950,7741,523,222,681984,058,58002,433,024
8Jun 6, 2021 18:1950,8201,524,598,352981,136,00702,293,760
9Jun 6, 2021 18:1950,8501,525,510,734977,068,88102,527,232