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:22Yuriy LyfenkoYuriy LyfenkoScore: 11,238Success
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:2210,844325,306,408803,008,71502,441,216
2Jun 7, 2021 16:2211,019330,563,726798,343,19002,420,736
3Jun 7, 2021 16:2211,152334,550,585802,376,20702,424,832
4Jun 7, 2021 16:2211,238337,125,965803,695,22202,543,616
5Jun 7, 2021 16:2211,274338,229,170801,143,49102,433,024
6Jun 7, 2021 16:2211,553346,581,872802,778,71102,437,120