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 17:24Yurkov AlekseyYurkov AlekseyScore: 45,610Success
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 17:2444,2321,326,953,7461,274,773,11702,383,872
2Jun 7, 2021 17:2444,7131,341,391,0501,277,405,67202,359,296
3Jun 7, 2021 17:2445,1491,354,478,5101,282,421,71602,363,392
4Jun 7, 2021 17:2445,6101,368,297,5181,312,099,26502,375,680
5Jun 7, 2021 17:2445,6271,368,813,2591,312,995,74402,371,584
6Jun 7, 2021 17:2445,8611,375,822,7011,311,004,64102,371,584