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:35Sergey StreminSergey StreminScore: 33,191Success
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:3532,236967,066,966913,476,88802,408,448
2Jun 6, 2021 17:3532,594977,827,176917,457,81502,396,160
3Jun 6, 2021 17:3532,713981,385,988917,425,55802,424,832
4Jun 6, 2021 17:3532,975989,241,384919,870,29002,412,544
5Jun 6, 2021 17:3533,191995,717,492933,223,35402,433,024
6Jun 6, 2021 17:3533,281998,432,682914,425,08902,404,352
7Jun 6, 2021 17:3533,3351,000,056,687920,885,17702,400,256
8Jun 6, 2021 17:3533,4361,003,071,753928,682,37002,441,216
9Jun 6, 2021 17:3533,8941,016,815,319933,757,81002,400,256