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:27Yuriy LyfenkoYuriy LyfenkoScore: 50,999Success
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:2750,0261,500,774,208947,986,62402,453,504
2Jun 6, 2021 18:2750,0731,502,203,847950,964,57902,424,832
3Jun 6, 2021 18:2750,0741,502,206,426952,993,76002,424,832
4Jun 6, 2021 18:2750,4221,512,661,743975,745,37402,572,288
5Jun 6, 2021 18:2750,9991,529,980,423985,910,78202,482,176
6Jun 6, 2021 18:2751,1331,533,992,717985,324,26402,408,448
7Jun 6, 2021 18:2751,2041,536,115,250977,857,28802,433,024
8Jun 6, 2021 18:2751,3251,539,751,047972,702,29302,449,408
9Jun 6, 2021 18:2751,5031,545,097,775982,059,77402,564,096