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 16:04Yuriy LyfenkoYuriy LyfenkoScore: 519,927Success
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 16:04517,63515,529,061,28115,473,873,01002,306,048
2Jun 6, 2021 16:04518,10915,543,261,80915,487,736,99302,396,160
3Jun 6, 2021 16:04518,18815,545,637,42915,472,516,19202,334,720
4Jun 6, 2021 16:04519,25415,577,625,14815,520,033,22802,367,488
5Jun 6, 2021 16:04519,92715,597,807,29015,501,888,00402,387,968
6Jun 6, 2021 16:04520,48415,614,509,85715,547,238,55902,396,160
7Jun 6, 2021 16:04521,49615,644,871,37715,568,073,68702,359,296
8Jun 6, 2021 16:04523,24815,697,442,37715,574,518,71802,400,256
9Jun 6, 2021 16:04528,55115,856,524,74115,793,580,52402,342,912