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 20:28Sergey StreminSergey StreminScore: 415,217Success
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 20:28386,79911,603,959,90734,098,732,72002,433,024
2Jun 6, 2021 20:28392,91711,787,501,23234,654,302,20202,523,136
3Jun 6, 2021 20:28412,28512,368,540,52836,312,658,05302,473,984
4Jun 6, 2021 20:28414,54712,436,403,19936,546,717,26102,326,528
5Jun 6, 2021 20:28415,21712,456,518,16636,599,115,90202,535,424
6Jun 6, 2021 20:28420,19812,605,946,74037,121,881,92402,592,768
7Jun 6, 2021 20:28420,51912,615,559,02237,115,065,27002,478,080
8Jun 6, 2021 20:28423,56812,707,034,35937,527,265,62402,527,232
9Jun 6, 2021 20:28429,81012,894,290,49038,032,881,16602,433,024