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 17:48Yuriy LyfenkoYuriy LyfenkoScore: 19,799Success
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 17:4815,020450,590,142961,956,05302,424,832
2Jun 6, 2021 17:4815,414462,418,716961,214,88602,416,640
3Jun 6, 2021 17:4819,607588,195,1301,108,898,08802,420,736
4Jun 6, 2021 17:4819,698590,932,5761,107,997,33902,531,328
5Jun 6, 2021 17:4819,799593,961,8381,106,203,86202,564,096
6Jun 6, 2021 17:4819,841595,230,4921,109,568,27802,445,312
7Jun 6, 2021 17:4819,897596,910,5171,108,548,70402,506,752
8Jun 6, 2021 17:4820,050601,497,6761,111,432,55702,486,272
9Jun 6, 2021 17:4820,089602,659,2651,105,815,22102,424,832