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 18:26Yuriy LyfenkoYuriy LyfenkoScore: 50,534Success
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 18:2649,9781,499,350,639965,941,89902,297,856
2Jun 6, 2021 18:2650,2691,508,084,379959,123,22802,543,616
3Jun 6, 2021 18:2650,4181,512,537,900977,039,56502,400,256
4Jun 6, 2021 18:2650,5151,515,442,043964,743,26402,437,120
5Jun 6, 2021 18:2650,5341,516,013,364961,444,53802,564,096
6Jun 6, 2021 18:2650,5861,517,587,451975,415,10302,416,640
7Jun 6, 2021 18:2650,6011,518,017,862962,312,60802,416,640
8Jun 6, 2021 18:2650,9261,527,783,723964,371,77402,564,096
9Jun 6, 2021 18:2650,9901,529,708,835978,152,78702,568,192