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:46Yurkov AlekseyYurkov AlekseyScore: 736,292Success
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:46693,01520,790,435,23561,918,385,50502,326,528
2Jun 7, 2021 16:46710,15821,304,735,54963,490,851,71802,445,312
3Jun 7, 2021 16:46727,48521,824,560,16364,663,340,26702,519,040
4Jun 7, 2021 16:46736,29222,088,749,56665,736,077,67702,519,040
5Jun 7, 2021 16:46738,66022,159,790,13666,028,704,82902,519,040
6Jun 7, 2021 16:46742,38722,271,618,69566,268,649,33602,461,696