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 16:42Yuriy LyfenkoYuriy LyfenkoScore: 54,487Success
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 16:4254,1171,623,511,235562,648,40702,236,416
2Jun 6, 2021 16:4254,1971,625,906,362562,239,26602,351,104
3Jun 6, 2021 16:4254,3191,629,561,034561,015,73902,248,704
4Jun 6, 2021 16:4254,3271,629,802,642566,925,07502,379,776
5Jun 6, 2021 16:4254,4871,634,608,090558,978,92102,355,200
6Jun 6, 2021 16:4254,8351,645,050,799566,050,30202,236,416
7Jun 6, 2021 16:4255,0111,650,315,794578,534,15902,351,104
8Jun 6, 2021 16:4255,0981,652,950,650579,778,57302,347,008
9Jun 6, 2021 16:4255,1481,654,445,651579,595,39902,351,104