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:40Yuriy LyfenkoYuriy LyfenkoScore: 7,935Success
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:407,713231,377,348508,403,30802,560,000
2Jun 7, 2021 16:407,778233,337,397507,982,88502,580,480
3Jun 7, 2021 16:407,799233,964,837510,111,71502,576,384
4Jun 7, 2021 16:407,935238,038,142510,538,17602,416,640
5Jun 7, 2021 16:408,150244,504,067510,799,36802,551,808
6Jun 7, 2021 16:408,284248,515,173511,044,05402,433,024