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 8, 2021 21:46Yuriy LyfenkoYuriy LyfenkoScore: 15,367Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2021 21:4714,968449,047,7881,160,864,95202,523,136
2Jun 8, 2021 21:4615,201456,016,2991,166,291,41402,445,312
3Jun 8, 2021 21:4715,242457,272,0381,123,507,27002,392,064
4Jun 8, 2021 21:4715,247457,403,7701,147,721,05002,535,424
5Jun 8, 2021 21:4615,367461,002,6231,176,178,65702,453,504
6Jun 8, 2021 21:4815,520465,609,7431,128,477,65002,400,256
7Jun 8, 2021 21:4615,669470,080,1871,176,674,02302,461,696
8Jun 8, 2021 21:4815,892476,758,3721,087,608,14302,383,872
9Jun 8, 2021 21:4815,938478,135,2091,165,640,32002,396,160