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:50Yurkov AlekseyYurkov AlekseyScore: 124,848Success
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:50118,6803,560,395,9358,439,120,82202,502,656
2Jun 7, 2021 16:50119,2203,576,597,5248,508,001,78502,400,256
3Jun 7, 2021 16:50121,0093,630,266,6198,612,490,20002,551,808
4Jun 7, 2021 16:50124,8483,745,433,9119,046,247,71402,445,312
5Jun 7, 2021 16:50125,9133,777,397,3089,029,337,97102,473,984
6Jun 7, 2021 16:50127,5283,825,843,7719,197,520,70202,568,192