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:20Yuriy LyfenkoYuriy LyfenkoScore: 11,373Success
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:2011,097332,904,644800,460,41402,379,776
2Jun 7, 2021 16:2011,123333,684,254802,237,48202,347,008
3Jun 7, 2021 16:2011,174335,222,416798,509,22202,498,560
4Jun 7, 2021 16:2011,373341,182,775815,442,30102,519,040
5Jun 7, 2021 16:2011,479344,379,224815,882,17302,473,984
6Jun 7, 2021 16:2011,866355,990,305815,270,97102,478,080