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:49Yurkov AlekseyYurkov AlekseyScore: 121,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 7, 2021 16:49109,0543,271,609,4107,702,049,68902,519,040
2Jun 7, 2021 16:49109,6303,288,889,6967,651,319,65902,498,560
3Jun 7, 2021 16:49120,6033,618,091,8148,519,635,33602,359,296
4Jun 7, 2021 16:49121,1913,635,732,3178,551,051,87802,519,040
5Jun 7, 2021 16:49122,5743,677,214,6818,693,336,68202,478,080
6Jun 7, 2021 16:49126,4363,793,084,8979,010,457,77702,539,520