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 16:17Yurkov AlekseyYurkov AlekseyScore: 53,571Success
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 16:1753,1671,594,997,0701,533,626,50002,379,776
2Jun 7, 2021 16:1753,3411,600,218,0331,526,989,49702,387,968
3Jun 7, 2021 16:1753,5201,605,596,1741,540,554,99502,379,776
4Jun 7, 2021 16:1753,5711,607,117,6731,539,028,78502,367,488
5Jun 7, 2021 16:1753,8581,615,739,7631,543,155,50502,363,392
6Jun 7, 2021 16:1755,1491,654,471,9381,588,109,26402,240,512