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 17:54Yuriy LyfenkoYuriy LyfenkoScore: 13,161Success
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 17:5412,798383,925,900858,195,01002,433,024
2Jun 6, 2021 17:5412,994389,805,232856,918,02602,437,120
3Jun 6, 2021 17:5413,071392,121,199851,848,51102,433,024
4Jun 6, 2021 17:5413,153394,578,741865,115,14902,424,832
5Jun 6, 2021 17:5413,161394,844,981864,624,51002,449,408
6Jun 6, 2021 17:5413,176395,282,194862,857,95602,428,928
7Jun 6, 2021 17:5413,330399,886,833857,024,43602,560,000
8Jun 6, 2021 17:5413,358400,752,290858,995,63902,555,904
9Jun 6, 2021 17:5413,715411,454,945858,576,18302,367,488