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 17:45Yuriy LyfenkoYuriy LyfenkoScore: 14,212Success
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 17:4514,080422,395,479926,725,07602,433,024
2Jun 6, 2021 17:4514,137424,097,736930,064,62102,449,408
3Jun 6, 2021 17:4514,148424,440,651929,834,80902,408,448
4Jun 6, 2021 17:4514,207426,196,543925,766,09902,449,408
5Jun 6, 2021 17:4514,212426,346,092932,987,86702,437,120
6Jun 6, 2021 17:4514,282428,463,128927,429,76402,568,192
7Jun 6, 2021 17:4514,282428,463,030927,831,05602,502,656
8Jun 6, 2021 17:4514,366430,970,027908,896,60002,510,848
9Jun 6, 2021 17:4514,483434,497,994913,299,10402,506,752