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:00Yuriy LyfenkoYuriy LyfenkoScore: 13,544Success
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:0013,077392,313,654864,322,64102,412,544
2Jun 7, 2021 16:0013,212396,355,805856,930,33702,543,616
3Jun 7, 2021 16:0013,255397,655,842860,073,63502,535,424
4Jun 7, 2021 16:0013,544406,318,360863,555,48602,555,904
5Jun 7, 2021 16:0013,688410,654,392855,043,56902,412,544
6Jun 7, 2021 16:0013,716411,469,786862,998,61702,412,544